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.

  • Infinitesimal cranking for triaxial angular-momentum-projected configuration-mixing calculation and its application to the gamma vibrational band


    year of publication: 2016 arXiv

  • Holonomic Tools for Basic Hypergeometric Functions


    year of publication: 2016 arXiv

    • Combinatorics
    • Symbolic Computation
  • Gradient Ricci solitons with vanishing conditions on Weyl


    year of publication: 2016 arXiv

    • Differential Geometry
  • Relativistic structure formation models and gravitoelectromagnetism


    year of publication: 2016 arXiv

    • Cosmology and Nongalactic Astrophysics
  • On p-adic differential equations with separation of variables


    year of publication: 2016 arXiv

    • Symbolic Computation
  • Optimal exponents for Hardy--Littlewood inequalities for $m$-linear operators


    year of publication: 2016 arXiv

    • Functional Analysis

    MSC 2010: 47B10 47B37

  • The Multiplicative Automorphisms of a Finite Nearfield, with an Application


    year of publication: 2016 arXiv

    • Combinatorics
    • Group Theory
    • Rings and Algebras
  • Optimal Prefix Free Codes With Partial Sorting


    year of publication: 2016 arXiv

    • Data Structures and Algorithms
  • Sparse solutions of linear Diophantine equations


    year of publication: 2016 arXiv

    • Combinatorics
    • Commutative Algebra
    • Optimization and Control
  • Faster Longest Common Extension Queries in Strings over General Alphabets


    year of publication: 2016 arXiv

    • Data Structures and Algorithms
  1. 1
  2. ...
  3. 104
  4. ...
  5. 272