ProbXiv
sign in

An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Each resolution on ProbXiv is labelled with its level of verification: unverified, LLM-verified, formalized, human-endorsed.

problems

881900 of 1,183 problems
  • The Thin Matching ProblemNima Anari, Moses Charikar, Prasanna Ramakrishnan, 2023

    Anari, Charikar and Ramakrishnan asked whether every fractional perfect matching admits a perfect matching that is α-thin with respect to it, meaning it crosses every cut at most α times the fractional amount. Resolved up to…

    partial

    1 attempt

  • Graffiti Conjecture 154 (Standard-Deviation Reading)Graffiti (Siemion Fajtlowicz's program), 1990

    For every connected graph, is the deviation of its adjacency eigenvalues at most its order divided by its average distance? Exact lollipop-graph certificates refute the inequality when deviation means population standard deviation, under…

    variant

    1 attempt

  • An ℓ-Oddtown is a family of subsets of an n-element set whose set sizes are not divisible by ℓ while all pairwise intersection sizes are. Berlekamp and Graver showed the maximum size is n for prime ℓ, Babai and Frankl extended this to…

    disproved

    1 attempt

  • A tournament orients every pair in a round-robin (winner → loser). The score sequence is the sorted win-count list. Reversing a directed 3-cycle never changes scores, so score-equivalent tournaments can look structurally different.…

    solved

    1 attempt

  • Do n point charges whose electrostatic potential has only non-degenerate critical points always have at most (n-1)^2 of them? A configuration of five charges - three at the vertices of an equilateral triangle plus two small central charges…

    disproved

    1 attempt

  • Godara and Sarkar proved d(H_27)=6 for the exponent-p Heisenberg group and posed d(H_p^3)=3p-3 for every odd prime p, leaving p≥5 open. The paper settles the first open case, d(H_125)=12, the upper bound reducing to a finite spread bound…

    solved

    1 attempt

  • A Counterexample to Nivat's Conjecture for a Non-Convex WindowMaurice Nivat; the specific question by Jarkko Kari and Etienne Moutot, 2023

    The paper constructs an exact cluster F⊆Z^2 of cardinality 8 with full affine span and an F-tiling whose orbit closure contains no 1-periodic F-tiling, giving a non-degenerate counterexample to Nivat's conjecture for non-convex windows.…

    disproved

    1 attempt

  • For an odd prime p, do Sun's normalized trigonometric permanents satisfy s_p < 0 ⇔ p ≡ 5 pmod12 and s'_p < 0 ⇔ p ≡ 7 pmod 8? Exact computation at p = 29 refutes both sign laws.

    disproved

    1 attempt

  • For a projective variety X with at worst Gorenstein canonical singularities whose stringy E-function E_st(X; u, v) is a polynomial, all stringy Hodge numbers h^p,q_st(X) are non-negative. (Batyrev 1998, Conjecture 3.10.)

    disproved

    1 attempt

  • We prove that every PPT linear map has finite entanglement-breaking index, thereby establishing the eventual entanglement-breaking property of PPT channels in full generality. Furthermore, by utilizing completely positive maps with low…

    solved

    1 attempt

  • The Target-Free Clique Conjecture for Threshold-Linear NetworksCarina Curto, Jesse Geneson, Katherine Morrison, 2019

    The target-free clique conjecture asserts that the supports of stable fixed points of a nondegenerate combinatorial threshold-linear network are exactly its target-free cliques, the bidirected cliques no outside vertex receives an edge…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Energy measures of any two nonconstant harmonic functions on the standard Sierpinski gasket are mutually absolutely continuous. Strichartz and Tse reported numerical evidence that the Radon-Nikodym densities are L^p-integrable for 1 < p <…

    solved

    1 attempt

  • The 4-Color Rado Number of x+y+c=z: R(c)=40c+41 Whenever c+1 Is Divisible by 3, 4, 5 or 7ABEMRS16 (Math. Comp. 85, 2016, §5.5); Myers (Ph.D. thesis, 2015, Conj. 4.9), 2015

    R(c) = 40c+41 for every c ≥ 2 such that c+1 is divisible by 3, 4, 5, or 7 (covering ≈ 66% of all c); the full conjecture (Myers 2015 Conj. 4.9, ABEMRS16 §5.5) reduces to prime cases p ≥ 89, all smaller primes settled by SAT. Twenty-eight…

    partial

    1 attempt

  • Does planarity help approximate counting? The paper gives an FPRAS for the planar hard-core partition function at small activity, proves that approximately counting q-colourings on planar graphs is NP-hard for every constant q ≥ 4, and…

    solved

    1 attempt

  • Sampling a nearly uniform Eulerian tour of a directed Eulerian multigraph was stuck at mn-type running times coming from arborescence sampling. A randomized algorithm achieves widetildeO(m^3/2) worst case, breaking that barrier on sparse…

    solved

    1 attempt

  • Exhaustive AdaBoost Cycling QuestionCynthia Rudin, Robert Schapire & Ingrid Daubechies, 2012

    Does exhaustive AdaBoost always converge to a finite cycle of weak classifiers and weight vectors on every finite training set? A finite instance whose orbit never becomes periodic answers no.

    disproved

    1 attempt

  • For semifree noncommutative differential graded algebras over a nontrivial computable unital commutative ring, are stable tame isomorphism, quasi-isomorphism, or derived Morita equivalence algorithmically decidable? All three are…

    disproved

    1 attempt

  • Erdős Problem #623Paul Erdős, András Hajnal, 1958

    Let X be a set of cardinality ℵ_ω and f a function from the finite subsets of X to X such that f(A)not∈ A for all A. Must there exist an infinite independent Y⊆ X, i.e. with f(B)not∈ Y for all finite B⊂ Y? Claimed resolution: the positive…

    candidate

    1 attempt

  • Baker asked, as recorded by Poonen, whether a fixed smooth quasiprojective variety over a finite field must acquire a smooth rational hyperplane section after every sufficiently high-dimensional linearly nondegenerate embedding. Poonen…

    disproved

    1 attempt

  • The Espuny Diaz-Lichev-Wesolek Conjecture on Dirac SubgraphsAlberto Espuny Diaz, Lyuben Lichev, Alexandra Wesolek

    Espuny Diaz, Lichev and Wesolek conjectured that a Dirac-type minimum degree condition forces Hamiltonicity in spanning subgraphs of cycle powers. Asymptotically true: for every ε > 0 and all large k, any spanning subgraph of the kth power…

    partial

    1 attempt