ProbXiv
Explorersign in

problems

Leaderboard716 problems
561–580 of 716 problems
  • Erdős Problem #888Paul Erdős, 1998

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • Bertoin-Yor Moment Determinacy ConjectureJean Bertoin, Marc Yor, 2002

    For an unkilled Levy process ξ drifting to +∞ with all positive exponential moments, let I_ξ = ∫_0^∞ e^-ξ_t dt and X_ξ = 1/I_ξ. Bertoin and Yor proved X_ξ is moment-determinate when ξ has no positive jumps and conjectured that this…

    solved

    1 attempt

  • The Signed BAR Uniqueness ProblemJ. Michael Harrison, Martin I. Reiman, 1990

    For a multidimensional reflected diffusion, does the basic adjoint relationship uniquely characterize the stationary distribution? The question had stood unresolved for more than thirty-five years since the BAR approach was introduced. For…

    solved

    1 attempt

  • Lorist-Schwenninger Remark 2 positivity questionEmiel Lorist, Felix L. Schwenninger, 2026

    Lorist and Schwenninger prove Crouzeix's conjecture (arXiv:2608.03841, Lemma 1) by combining a lower bound (their inequality (4)) with an upper bound (inequality (5)). In Remark 2 they observe that (5) alone gives κ ≤ 1 + √1 - ℜ⟨ E_1…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Optimality of Greedy for Single-Pass Semi-Streaming MatchingFeigenbaum, Kannan, McGregor, Suri, Zhang, 2005

    Can any single-pass semi-streaming algorithm beat the naive greedy 1/2-approximation for maximum matching? No. No single-pass semi-streaming algorithm, deterministic or randomized, achieves a better-than-half approximation, so greedy is…

    solved

    1 attempt

  • The Dimer Constant of the Cubic Latticeclassical lattice statistics

    The dimer constant of Z^3, the exponential growth rate of perfect matchings of the cubic lattice, has no closed form and is pinned only by bounds. The upper bound improves from Lundow's 0.457547, standing since 2001, to 0.452130, via…

    partial

    1 attempt

  • Erdős Problem #152Paul Erdős, András Sárközy, Vera T. Sós, 1994

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • Deng, Tidor and Zhao asked whether [N] admits a coloring with N^o(1) colors and no symmetrically coloured 4-term arithmetic progression, giving an O(N^log_223) coloring. The paper gives an O_k(N^4/k^2) coloring of [N] avoiding…

    partial

    1 attempt

  • What is the optimal competitive ratio for online vertex cover when edges arrive one at a time? The paper proves a tight factor-2 lower bound via a reduction in the blueprint framework of Assadi, Jiang and Xiang, closing the gap left by…

    solved

    1 attempt

  • WOWII Conjecture 72: Two induced trees pin down tree( G )Ermelinda DeLaViña (Graffiti.pc / Written on the Wall II), 2001

    For a connected graph G , let t= tree( G ) (order of a largest induced tree), A= average eccentricity, and L= maximum independence number of a neighbourhood. Then ⌈ (A+L)/3 ⌉ ≤ t. (The evenly-divided reading of the conjecture holds; a…

    candidate

    1 attempt · a verdict recorded from elsewhere

  • Let U_n⊂ R^n be the difference polytope of a regular n-simplex such that U_n circumscribes a sphere of diameter 1. Then every set of diameter 1 in R^n is covered by a rotated copy of U_n.

    disproved

    1 attempt

  • Sharp global and almost-everywhere convergence rates for periodic homogenization of viscous quadratic Hamilton-Jacobi equations, settling the sharpness question left open by the first-order theory.

    solved

    1 attempt

  • Reiner conjectured a description of the homotopy types of intervals in higher Bruhat orders. In corank 3 it holds: the facial intervals of B(n,n-3) are exactly the spherical intervals, and every other interval is contractible.

    partial

    1 attempt

  • Every purely-maximal ideal of a commutative ring is purely-prime, and the converse holds for several important classes of rings; Tarizadeh conjectured (Conjecture 5.8 of his earlier published paper) that in a commutative ring every…

    disproved

    1 attempt

  • Gamow liquid-drop minimizer conjectureGeorge Gamow (the functional, c. 1930); the sharp-threshold conjecture stated in the modern liquid-drop literature

    For a measurable set Ω⊂ R^3, let E(Ω)=P(Ω)+frac12iint_Ω×Ωdx dy/|x-y|, where P is De Giorgi perimeter, and set V_*=5frac2-2^2/32^2/3-1≈3.51. The conjecture asks for the complete fixed-volume minimization picture. Chodosh and Gianocca prove…

    solved

    1 attempt

  • If n planar points have no four concyclic, must some point determine (1 - o(1))n distinct distances? Failing that, can one always force more than (1/3 + c)n?

    variant

    1 attempt · a verdict recorded from elsewhere

  • Define φ_k(n) = ∑_1 ≤ a ≤ n, (a,n)=1 a^k and D_s = k ≥ s : φ_s(n) | φ_k(n) for every n. Is D_1 = 1, 3, 15, as conjectured by Büyükaşik and collaborators?

    solved

    1 attempt

  • Does a universal summation process recover the degree of a circle map from its Fourier moduli, that is, does ∑_n σ_n,ε n |hat f(n)|^2 → deg f hold for Holder maps below the threshold? No. For every 0 < α < 1/3 there is an f ∈…

    partial

    1 attempt

  • Facial Distance Patterns in Planar GraphsShay Mozes, Benjamin Wallheimer, Oren Weimann (ISAAC 2022), 2022

    For a designated face of an undirected unweighted planar graph, how many distinct distance patterns can vertices have? Li and Parter (STOC 2019) proved an upper bound; Mozes, Wallheimer and Weimann conjectured the true answer matches their…

    solved

    1 attempt

  • For the three-dimensional paraboloid P_3 over a prime field in which -1 is not a square, the Fourier extension operator maps L^2 to L^r for r > 176/51 = 3.45098…, improving the exponent by combining a bilinear approach with point-line…

    partial

    1 attempt