What is Problem Mining? This is a tool based on data of arXiv.org which periodically scans packets of full texts of papers hosted on arXiv and available through arXiv's bulk data access policy, with the aim to automatically detect papers containing discussions on open problems or conjectures. It then creates a list from the detected papers putting together papers' descriptive data and some short snippets extracted from the full texts displaying an information on open problems or conjectures presented in the paper. The papers appearing on this list are only references to the arXiv's versions and we do NOT store the actual papers (TeX sources or PDFs) on our servers. To read any of the papers in this list one needs to follow the arXiv link displayed on the papers' blocks.

You can search within the list using keywords, author names, and subject area. By a simple click of the Interesting button, you may anonymously indicate your interest in the problem. If you think the automatic extraction resulted in incorrect data, you may click on the False positive button instead. The Stats section shows the worldwide interest by our users on a specific problem.

  • Palindromic Automorphisms of Free Groups


    year of publication: 2014 arXiv

    • Group Theory

    MSC 2010: 20E05 20E36 20F28

  • The chemical evolution of galaxies with a variable IGIMF


    year of publication: 2014 arXiv

    • Astrophysics of Galaxies
  • Fast Randomized Kernel Methods With Statistical Guarantees


    year of publication: 2014 arXiv

    • Computation
    • Machine Learning
  • Expected degree for RNA secondary structure networks


    year of publication: 2014 arXiv

    • Biomolecules
  • Completely packed O($n$) loop models and their relation with exactly solved coloring models


    year of publication: 2014 arXiv

    • Statistical Mechanics
  • Exact forbidden subposet results using Chain decompositions of the Cycle


    year of publication: 2014 arXiv

    • Combinatorics
  • Higher Spin Currents in Wolf Space for Generic N


    year of publication: 2014 arXiv

  • On-line coloring between two lines


    year of publication: 2014 arXiv

    • Combinatorics
    • Computational Geometry
  • Behavioural equivalences for coalgebras with unobservable moves


    year of publication: 2014 arXiv

    • Logic in Computer Science
  • The category of noncrossing partitions


    year of publication: 2014 arXiv

    • Representation Theory

    MSC 2010: 16G20

  1. 1
  2. ...
  3. 176
  4. ...
  5. 272