ProbXiv
sign in

Problems

No person has reviewed any of this; every judgement here is a machine's.

clear
241260 of 266 problems
  • The da Silva Machado-Seade Conjectureda Silva Machado, Jose Seade

    da Silva Machado and Seade conjectured that weighted homogeneous isolated hypersurface singularities are exactly those admitting a logarithmic vector field transverse to the link. True: for a reduced isolated hypersurface germ in C^n+1…

  • 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?

  • 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.

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

    Let k,r≥ 2. Does there exist a set A⊆ N that contains no non-trivial arithmetic progression of length k+1, yet in any r-colouring of A there must exist a monochromatic non-trivial arithmetic progression of length k? Answered in the…

    Number theory
    solved

    1 attempt · machine-checked by Lean

  • 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…

  • 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…

  • 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…

  • 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…

  • 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…

  • 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…

  • 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…

  • 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…

    Combinatorics
    solved

    1 attempt · a verdict recorded from elsewhere

  • 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…

    Algebra
    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…

  • 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…

    Algebra
    solved

    1 attempt

  • Let f_3(N) be the least size forcing a set A ⊆ 1,…,N to contain distinct a,b,c with a+b, a+c and b+c all in A. The upper bound f_3(N) ≤ 5N/8 + O(1) matches the standard construction [N/8,N/4] ∪ [N/2,N], so f_3(N) = 5N/8 + O(1).

    Combinatorics
    solved

    1 attempt · machine-checked by Lean

  • 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…

    Algebra
    solved

    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…

  • The Elton–Odell theorem gives, in every infinite-dimensional normed space, a unit-sphere sequence with mutual distances at least 1+ε. Over C, identifying vectors differing by a unimodular scalar gives a toroidal distance. Does every…

  • Phelps–Rodriguez ConjectureDean Phelps, Rene S. Rodriguez, 1972

    Let p be a complex polynomial of degree n≥2 whose zeros all lie in the closed unit disk. For every zero a of p, there is a critical point ζ satisfying |ζ-a|<1, except when |a|=1 and p is a nonzero scalar multiple of z^n-a^n.

    Analysis
    solved

    1 attempt · machine-checked by Lean