ProbXiv
Explorersign in

problems

Leaderboard716 problems
421–440 of 716 problems
  • 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

  • Lower Bounds for Stepsize-Based Acceleration of Gradient DescentRaised by the silver-stepsize line of work following Altschuler and Parrilo, 2023

    Carefully designed stepsize schedules alone accelerate plain gradient descent beyond its textbook O(1/T) rate, without momentum. Whether they can reach the optimal O(T^-2) was open. A lower bound of Omega(T^-1.9319) for last-iterate…

    partial

    1 attempt

  • Let H(n) be the largest number of vertices in a hypergraph with no isolated vertices and no partition of size greater than n. With k_1 = 1 and k_n = ⌊ n/2 ⌋ + k_⌊ n/2 ⌋ + k_⌈ n/2 ⌉, prove H(n) ≥ c k_n for some constant c > 1, already for n…

    solved

    1 attempt

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

    disproved

    1 attempt

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

    disproved

    1 attempt

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

    disproved

    1 attempt · a verdict recorded from elsewhere