ProbXiv
sign in

problems

586 problems
401–420 of 586 problems
  • Odifreddi asked, as Problem 3 in his surveys "Strong Reducibilities" (1981) and "Reducibilities" (1999), whether every computably enumerable tt-degree contains a c.e. irreducible m-degree, meaning an m-degree consisting of a single…

    disproved

    1 attempt

  • Among classes of tournaments for which neither hardness nor polynomial-time solvability of isomorphism was known, bounded VC dimension stood out as an open problem of Neuen and Grohe. Resolved: isomorphism of tournaments of VC dimension d…

    solved

    1 attempt

  • A graph G is maximal non-Hamiltonian if it is non-Hamiltonian but G + e is Hamiltonian for every nonedge e. In 1994 Vu Dinh Hoa conjectured a property of G - V(C) for a longest cycle C of such a graph. Disproved by an explicit base graph…

    disproved

    1 attempt

  • Erdős Problem #960Paul Erdős, 1984

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Adjamagbo's positive-characteristic refinement of the Jacobian conjecture asks that a polynomial endomorphism with unit Jacobian determinant whose induced function-field extension has degree prime to the characteristic be an automorphism.…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Johnson-Freyd-Ostrik-Yu Question on Categorical CocyclesTheo Johnson-Freyd, Victor Ostrik, Matthew Yu

    Twisted Deligne products categorify the tensor product of two Grothendieck rings. Classifying them leads to categorical n-cocycles, and Johnson-Freyd, Ostrik and Yu asked whether these are always pullbacks of ordinary group cocycles on the…

    partial

    1 attempt

  • Does every nonlocal game admitting a perfect entangled strategy admit one using a maximally entangled state? Described in the paper as one of the longstanding open problems in quantum nonlocality. Answered negatively by an explicit…

    disproved

    1 attempt

  • Dyn and Farkhi conjectured that the squared Hausdorff distance from a compact set to its convex hull is subadditive under Minkowski addition. It holds in dimensions one and two and fails from dimension three; the sharp threshold exponent…

    solved

    1 attempt

  • Erdős Problem #1089Paul Erdős, 1975

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • A dimension-independent subgaussian concentration bound for Gaussian vectors under coordinate-wise nonlinear maps, valid for any bounded function under a well-conditioned covariance, which answers a question of Simone Bombari on sign…

    solved

    1 attempt

  • Pak and Slonim conjectured that stretched Schubert structure constants are eventually polynomial. They are. Monomial coefficients in affine families of key and Schubert polynomials are eventually polynomial, and the Schubert duality of…

    solved

    1 attempt

  • Erdős Problem #987Paul Erdős, 1964

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Erdős Problem #906Paul Erdős, 1956

    Is there an entire non-zero function f:C→ C such that, for any infinite sequence n_1<n_2<…, the set z: f^(n_k)(z)=0 for some k≥ 1 is everywhere dense? The literal question is trivial for polynomials, so the claims address the…

    candidate

    1 attempt

  • Pólya conjectured in 1954 that the Weyl-law expression bounds the eigenvalue counting function of the Laplacian. The paper proves the Neumann case for Euclidean balls in dimensions three and higher, extending the authors' earlier planar…

    solved

    1 attempt

  • Let M(n) be the supremum of ∑_a ∈ A 1/(n-a) over pairwise coprime A ⊂ [1,n). Erdos asked whether M(n) ≤ ∑_p<n 1/p + O(1) uniformly. The average order is settled: ∑_n ≤ N M(n) = e^-γ N loglog N + O(N).

    partial

    1 attempt

  • The Chen-Lawrencenko Conjectures on Cyclic ColorationsBeifang Chen, Serge Lawrencenko, 1999

    A cyclic coloration of a triangulation of a closed 2-manifold gives the faces around every vertex distinct colors. Chen and Lawrencenko made two conjectures about the cyclic chromatic number of minimal triangulations in 1999. Their second…

    disproved

    1 attempt

  • Sixteen previously unknown exact values, plus three that confirm the sibling theorem entries' predictions computationally, across five ordered-pattern families (P^alt, S^sc, C^mon, M^nest, K) under dihedral and reflective group actions -…

    solved

    1 attempt · a verdict recorded from elsewhere

  • Is the O'Shea-Zames-Falb multiplier test necessary for robust stability of Lur'e systems with slope-restricted nonlinearities, as conjectured by Carrasco? No: there is a stable Lur'e interconnection, certified by a full-block multiplier,…

    disproved

    1 attempt

  • Erdős Problem #119Paul Erdős, 1957

    For unit-modulus complex numbers z_i, let p_n(z)=∏_i≤ n(z-z_i) and M_n=max_|z|=1|p_n(z)|. Erdős's prize question: is there c>0 with ∑_k≤ n M_k > n^1+c?

    solved

    1 attempt · a verdict recorded from elsewhere

  • Casalaina-Martin and Zhjeqi proved that the first Chern class of every torsion-free coherent quotient of a tensor power of the logarithmic cotangent sheaf is pseudo-effective, noting in Remark 4.5 that torsion-freeness was imposed only for…

    solved

    1 attempt