ProbXiv
Explorersign in

problems

Leaderboard716 problems
461–480 of 716 problems
  • A finite closure system can be given by implications or by a list of subsets closed under intersection. Deciding whether one specification of each kind defines the same family had remained open in several settings; the paper proves the…

    solved

    1 attempt

  • For the switch-walk-switch walk on Z_2 wr Z started at (0,0) and (0,2), prove |P_t^x - P_t^y|_TV asymp t^-1/2.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Conjectures of Hopkins, Sagan-Wilson and Defant et al. on Lattices, Parking Functions and the Plactic MonoidColin Defant, Zhongyang Jiang, René Marczinzik, Marco Segovia, David Speyer, Hugh Thomas, Nathan Williams; Sam Hopkins; Bruce Sagan and Jordan Wilson

    A collection of open problems from the algebraic and enumerative combinatorics literature, resolved in one paper: a conjecture of Defant, Jiang, Marczinzik, Segovia, Speyer, Thomas and Williams on the echelonmotion operator on modular…

    solved

    1 attempt

  • A conjecture attributed to Kontsevich holds that strata of quadratic differentials are aspherical, that is orbifold K(π,1) spaces. False: when there are at least four zeros or poles, no connected component of a genus-one stratum is an…

    disproved

    1 attempt

  • R_dih(P_a^alt, K_b) = 1 + (a-1)(b-1) for all a ≥ 4, b ≥ 1 — the a ≥ 4 slice of Conjecture 4.9 (Damnjanović–Đorđević, arXiv:2607.06817). Combined with the a = 3 case (see sibling entry), this resolves Conjecture 4.9 in full for a ≥ 3.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Fulek defined a weight-five three-row 0-1 matrix L_3 and asked whether ex(n, L_3) = O(n). It is: every r × s matrix avoiding L_3 has at most 27r + 2s ones, so 6n - 8 ≤ ex(n,L_3) ≤ 29n for n ≥ 5. The same argument covers an infinite family…

    solved

    1 attempt

  • Can S-decoding polynomials modulo a product of k primes be built with only k+1 nonzero coefficients, the minimum their own lower bound allows? Yes, via a general framework for special prime products. The consequence is that for any…

    solved

    1 attempt

  • Improved lower bounds for nine classical Ramsey numbers, including R(3,13) ≥ 61, R(3,18) ≥ 100, and seven R(4,k) records up to R(4,20) ≥ 237, found by AlphaEvolve-discovered search algorithms.

    partial

    1 attempt

  • Quantum Memory Advantage for Process Tomographyopen question in quantum learning theory

    Does quantum memory give a query-complexity advantage for learning an unknown quantum channel, when protocols without it must measure after each channel use and keep only a classical transcript? It does, and the paper also determines how…

    solved

    1 attempt

  • Monotone Slowdown of Turbulent Flame Speed under Curvaturecombustion-theory expectation, proved in 2D by Liu, Xin and Yu, 2018

    Curvature is expected to smooth flame-front wrinkles and so reduce turbulent flame speed, and in two-dimensional shear flows this was proved. In three dimensions it fails: there is a smooth periodic shear flow for which introducing…

    disproved

    1 attempt

  • Is the sequence W_0, W_1, …, W_n counting the flats of each rank of a matroid always unimodal? Rota conjectured yes in 1970.

    disproved

    1 attempt

  • Erdős Problem #948Paul Erdős, 1977

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • Erdős Problem #1092Paul Erdős, 1976

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

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Maximum Entropy of Sums of Independent Ternary Random Variablesclassical; extends the Shepp-Olkin-Mateev theorem

    The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet, settled in the ternary case. For independent X_1, …, X_n taking values in 0,1,2, the entropy of S_n = X_1 + ……

    solved

    1 attempt

  • Bondal-Polishchuk Conjecture for a Smooth Projective VarietyAlexei Bondal, Alexander Polishchuk, 1993

    Bondal and Polishchuk conjectured in 1993 that the braid group acts transitively on the set of full exceptional collections in a triangulated category. Chang, Haiden and Schroll disproved it for partially wrapped Fukaya categories, but no…

    disproved

    1 attempt

  • Dihedral and cyclic Ramsey numbers of the alternating 3-pathDamnjanović–Đorđević (Conj 4.9); Bašić–Damnjanović–Stevanović–Stošić (Conj 4.23), 2026

    R_dih(P_3^alt, K_b) = R_cyc(P_3^alt, K_b) = 2b - 1 for all b ∈ N — the a = 3 slice of Conjecture 4.9 (Damnjanović–Đorđević, arXiv:2607.06817) and Conjecture 4.23 (Bašić–Damnjanović–Stevanović–Stošić, arXiv:2604.16188).

    solved

    1 attempt · a verdict recorded from elsewhere

  • Mason conjectured the following: let M be a matroid of rank r, and let W_i denote the number of flats of M of rank i. Is it true that for all 1 ≤ i ≤ r - 1, we have W_i^2 ≥ W_i + 1W_i - 1? This is false; a counterexample is given by a…

    disproved

    1 attempt

  • An n-divisor set contains a multiple of every integer from 1 to n. Umans and Wang proposed, as the arithmetic-progression form of their Strong (α,β)-Divisor Conjecture, that such a progression exists with few terms of bounded magnitude,…

    disproved

    1 attempt

  • The directed five-dimensional torus D_5(m) has a Hamilton decomposition for every odd m ≥ 3, extending the decomposition program for directed tori beyond the three-dimensional case.

    solved

    1 attempt

  • Nikolov-Ullman Pure-DP Query Release ConjectureAleksandar Nikolov, Jonathan Ullman

    Nikolov and Ullman asked, as Open Problem 1 on DifferentialPrivacy.org, whether k statistical queries over a universe of size T can be released under pure differential privacy at the square-root error rate that the known lower bounds…

    solved

    1 attempt