ProbXiv
Explorersign in

problems

Leaderboard716 problems
681–700 of 716 problems
  • Existence of Bipartite Bound InformationNicolas Gisin & Stefan Wolf, 2000

    Does bipartite bound information exist: classical correlations between two parties and an eavesdropper that cost secret bits to create, yet from which no secret key can ever be distilled?

    solved

    1 attempt

  • Composites Among [ξ 7^n] and Right-Truncatable Primes in Base 7Forman and Shapiro (1967), Dubickas and Novikas (2005), 2005

    For every real ξ>0 the sequence of integer parts [ξ 7^n], n=0,1,2,…, contains infinitely many composite numbers. Second, there is no infinite right truncatable prime in base~7.

    solved

    1 attempt

  • Prim-Dijkstra routing interpolates between a minimum spanning tree and a shortest-path tree, and has been used and improved in VLSI physical design since the early 1990s, but the complexity of the terminal-only Manhattan decision problem…

    solved

    1 attempt

  • Remodeling for the Affine Binary Dihedral Calabi–Yau ThreefoldBouchard, Klemm, Mariño and Pasquetti (remodeling conjecture)

    The paper proves a closed-string remodeling statement for the affine binary dihedral Calabi–Yau orbifold threefold, a target outside the toric setting of the Bouchard–Klemm–Mariño–Pasquetti remodeling conjecture, replacing the toric mirror…

    variant

    1 attempt

  • What is the optimal uniform continuity bound for quantum conditional entropy in trace distance, depending only on the dimension of the conditioned system? The sharp bound h_2(δ) + δ log(d^2 - 1) up to δ = 1 - d^-2, conjectured by Wilde, is…

    solved

    1 attempt

  • The Bandelt-Dress Quartet Distance ConjectureHans-Jurgen Bandelt, Andreas Dress, 1986

    The quartet distance counts the four-leaf subsets on which two binary phylogenetic trees display different topologies. Bandelt and Dress conjectured the maximum over trees on n leaves. Proved: it is (2/3 + o(1))binomn4, by reducing…

    solved

    1 attempt

  • The Coxeter Code Minimum Distance ConjectureNolan Coble, Alexander Barg, 2025

    Coble and Barg introduced binary Coxeter codes, the span of indicators of standard cosets of fixed rank in a finite Coxeter system, generalizing Reed-Muller codes, and proposed a conjectural value for the minimum distance of a general…

    solved

    1 attempt

  • Gaussian Mass Maximality of the Integer LatticeOded Regev, Noah Stephens-Davidowitz, 2017

    Regev and Stephens-Davidowitz conjectured that Z^n maximizes the Gaussian mass Θ_L(t) = ∑_x ∈ L e^-t|x|^2 over stable lattices for every t > 0. The sharp inequality holds for every integral unimodular lattice of rank n ≤ 32, with equality…

    partial

    1 attempt

  • Kawauchi conjectured that the Conway polynomial of an amphicheiral knot factors as ∇_K(z) = f(z)f(-z) for an integer polynomial f. Hartley proved it for negative amphicheiral knots and Ermotti, Hongler and Weber published the first…

    solved

    1 attempt

  • The dissipative barrier method suppresses spectral pollution when a differential operator is truncated, but can it hide genuine spectral points? Known as the graveyard problem, the question stayed open in dimension two and above for more…

    solved

    1 attempt

  • The Ellipsoid Fitting ConjectureJames Saunderson, Pablo A. Parrilo, Alan S. Willsky, 2013

    Given n independent standard Gaussian vectors in R^d, an ellipsoid fit is a positive semidefinite S with x_i' S x_i = d for every i. Saunderson, Parrilo and Willsky conjectured that this semidefinite feasibility problem has a sharp…

    solved

    1 attempt

  • Donner proved in 1992 that the list color function P_ℓ(G,k) equals the chromatic polynomial P(G,k) once k is large. Kaul and Mudrock asked whether the analogue holds for Hanlon's unlabeled chromatic polynomial, and could not settle even…

    solved

    1 attempt · a verdict recorded from elsewhere

  • A monic prime P of F_q[T] is a c-Wieferich prime if ρ_P(1) ≡ 1 bmod P^2 for the Carlitz module ρ. On limited data and proofs in degrees 2 and 3, Thakur suggested in 2015 that in odd characteristic every c-Wieferich prime has degree…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Does the Benjamini-Hochberg procedure always control the false-discovery rate at its nominal level for correlated two-sided Gaussian p-values? A factor model gives FDR > 0.0104 at nominal level α = 0.01.

    disproved

    1 attempt

  • For the set of n by n doubly stochastic matrices, Kim and Roush conjectured in 1981 that for odd n = 2k+1 > 1 the maximum of per(I-A) equals 3 times 2^(k-2), attained by an explicit block construction. Proved in full, and the maximizers…

    solved

    1 attempt

  • Gao, Huo and Ma asked whether for every fixed k ≥ 3 there is a function f_k(n) → ∞ such that every n-vertex (k+1)-critical graph contains f_k(n) consecutive cycle lengths. The paper settles this and two related problems on cycle lengths…

    solved

    1 attempt

  • Stability Radius of the Lamplighter GroupAlon Dogon, Arie Levit, Itamar Vigdorovich

    Dogon, Levit and Vigdorovich asked for an explicit upper bound on the stability radius of an infinitely presented group. The lamplighter group provides the first: explicit polynomial bounds on both its Hilbert-Schmidt stability rate and…

    solved

    1 attempt

  • The Virtual Surjection Conjecture for Discrete GroupsMartin Bridson, James Howie, Charles Miller III, Hamish Short, 2013

    If a subgroup of a product of groups of type F_k virtually surjects onto every k-tuple of factors, must it be of type F_k itself? Yes, for discrete groups, and likewise for FP_k. The homological n-(n+1)-(n+2) Conjecture follows for…

    solved

    1 attempt

  • Is a Werner state that is not one-copy distillable ever two-copy distillable? The first open rung of the NPT bound-entanglement ladder, open since 2000.

    disproved

    1 attempt

  • Weakly Compact Factorization Through a Space With a BasisDavis, Figiel, Johnson and Pełczyński; raised again by Kevin Beanland, 1974

    Davis, Figiel, Johnson and Pełczyński showed their interpolation space admits a Schauder basis when the range space has a shrinking one. Can the DFJP space always be chosen with a basis whenever the range space has a basis? The paper…

    solved

    1 attempt