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.

  • Clique-width and edge contraction


    year of publication: 2013 arXiv

    • Discrete Mathematics
    • Logic in Computer Science
  • Discrete random walks on the group Sol


    year of publication: 2013 arXiv

    • Group Theory
    • Probability

    MSC 2010: 22E25 22E40 43A80 60G50

  • The Krull filtration of the category of unstable modules over the Steenrod algebra


    year of publication: 2013 arXiv

    • Algebraic Topology

    MSC 2010: 18E10 55P47

  • Large time limit and local L^2-index theorems for families


    year of publication: 2013 arXiv

    • Differential Geometry
    • Geometric Topology
  • A Gauge Field Model of Modal Completion


    year of publication: 2013 arXiv

    • Disordered Systems and Neural Networks
    • Neurons and Cognition
  • Dynamical Gauge Symmetry Breaking in Strongly Coupled Lattice Theories


    year of publication: 2013 arXiv

  • A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates


    year of publication: 2013 arXiv

    • Data Structures and Algorithms
  • Unions of Lebesgue spaces and $A_1$ majorants


    year of publication: 2013 arXiv

    • Classical Analysis and ODEs
    • Functional Analysis
  • Secure Cooperative Regenerating Codes for Distributed Storage Systems


    year of publication: 2012 arXiv

    • Information Theory
  • Computing Néron-Severi groups and cycle class groups


    year of publication: 2012 arXiv

    • Algebraic Geometry
    • Number Theory

    MSC 2010: 14C22 14C25 14F20

  1. 1
  2. ...
  3. 235
  4. ...
  5. 272