ProbXiv
sign in

Problems

No problem here has yet been reviewed by a person.

4160 of 164 problems
  • Monical's Saturated Newton Polytope ConjectureCara Monical, Neriman Tokcan & Alexander Yong, 2017

    If a chromatic symmetric function is Schur positive, must every finite-variable specialization X_G(x_1, …, x_k) have a saturated Newton polytope? A 12-vertex bipartite graph realizes weights (6,6,0) and (8,2,2) but omits their midpoint…

  • Chromatic quasisymmetric functions of natural unit interval graphs were conjectured to have log-concave coefficients in the elementary basis. A connected 13-vertex example refutes it: for the Hessenberg function…

    Combinatoricsdisproved

    1 attempt · 1 machine check

  • Huneke-Wiegand ConjectureCraig Huneke & Roger Wiegand, 1994

    The Huneke–Wiegand Conjecture: Let R be a one-dimensional Gorenstein local domain, and let M be a finitely generated, non-zero, torsion-free R-module. If the tensor product M ⊗_R M^* is torsion-free, then M is a projective (hence free)…

    Algebradisproved

    1 attempt · 1 machine check

  • For an arrangement of n hyperplanes in P^3_C with ℓ intersection lines and p intersection points where at least three hyperplanes meet, the refined form of Purdy's inequality expects p - ℓ + n + 2 ≥ 0. An explicit arrangement built from…

    Geometry & topologydisproved

    1 attempt · 1 machine check

  • Conjecture 3 of the Dynamical Sampling SurveyAkram Aldroubi, Carlos Cabrelli, Ilya Krishtal, Ursula Molter, 2026

    Aldroubi, Cabrelli, Krishtal and Molter conjectured that for a bounded normal operator T and any vector g, the normalized orbit T^k g / |T^k g| : k ≥ 0 is never a frame. It can be: an explicit construction produces a normalized orbit that…

  • Simon conjectured that every skeleton of a simplex is extendably shellable. False: for every d ≥ 3 there is a pure d-dimensional shellable simplicial complex that is not shelling completable.

    Combinatoricsdisproved

    1 attempt · 1 machine check

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

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

  • Grothendieck asked whether every finite locally free group scheme of order n is killed by n (its n-th convolution power map equals the unit). The counterexample is an order-4 group scheme not killed by 4 (killed only by 8); since Deligne…

    Algebradisproved

    1 attempt · 1 machine check

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

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

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

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

    Combinatoricsdisproved

    1 attempt · 1 machine check

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

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

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

  • Does the middle-third Cantor measure admit a Fourier frame, that is, a countable set of exponentials giving two-sided frame bounds on its L^2 space? No. The Cantor measure with base b admits no Fourier frame for any odd integer b > 1,…

    Analysisdisproved

    1 attempt · 1 machine check

  • Unimodality of Kazhdan-Lusztig Polynomials of MatroidsKatie Gedeon, Nicholas Proudfoot, Benjamin Young, 2017

    Are the Kazhdan-Lusztig polynomials of matroids always unimodal - in particular log-concave, or even real-rooted, as conjectured? No: representable matroids obtained by deleting points from finite projective geometries have non-unimodal…

  • Zhao's Generalized Vanishing Conjecture asks whether, for a differential operator with constant coefficients, Λ^m(P^m) = 0 for all large m forces Λ^m(P^m Q) = 0 for all large m. Refuted by an explicit five-variable counterexample.

  • If Sidon sets A, B ⊆ 1, …, N satisfy (A-A) ∩ (B-B) = 0, must binom|A|2 + binom|B|2 ≤ binomf(N)2 + O(1), where f(N) is the largest Sidon-set size in [N] - and can the bound be improved by a fixed proportion when |A| = |B|?

    Number theorydisproved

    1 attempt · 1 machine check