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.

  • Striped phases from holography


    year of publication: 2013 arXiv

  • Surface electrons at plasma walls


    year of publication: 2013 arXiv

    • Plasma Physics
  • Property A for coarse spaces


    year of publication: 2013 arXiv

    • Metric Geometry
    • Operator Algebras

    MSC 2010: 20F65 46L05 51F99

  • R-adaptive multisymplectic and variational integrators


    year of publication: 2013 arXiv

    • Numerical Analysis

    MSC 2010: 65M99 65Z05

  • The reduction of qualitative games


    year of publication: 2013 arXiv

    • Computer Science and Game Theory
    • Optimization and Control

    MSC 2010: 91A80 91B50 91B52

  • Dissipation enhancement from a single vortex reconnection in superfluid helium


    year of publication: 2013 arXiv

    • Fluid Dynamics
    • Other Condensed Matter
  • Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions


    year of publication: 2013 arXiv

    • Data Structures and Algorithms

    MSC 2010: 05C85 68Q25 68R10 91C20

  • Ramified coverings of small categories


    year of publication: 2013 arXiv

    • Algebraic Topology
    • Category Theory

    MSC 2010: 18G30 55R05 55U10

  • Index Coding Capacity: How far can one go with only Shannon Inequalities?


    year of publication: 2013 arXiv

    • Information Theory
  • Parameterized Complexity of Discrete Morse Theory


    year of publication: 2013 arXiv

    • Computational Complexity
    • Computational Geometry
    • Geometric Topology

    MSC 2010: 57Q15 58E05 68Q15 68Q17 68R01

  1. 1
  2. ...
  3. 219
  4. ...
  5. 272