ProbXiv
Explorersign in

problems

Leaderboard716 problems
441–460 of 716 problems
  • Wegner conjectured in 1965 that every finite family R of axis-parallel rectangles satisfies τ(R) ≤ 2ν(R) - 1, where τ is the minimum number of piercing points and ν the largest pairwise-disjoint subfamily. False, by an explicit…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • What is the largest possible measure of a subset of a radius-R disk in R^2 containing no pair of points at a positive integer distance? A Poisson-Bessel kernel argument gives M(R) ≪ R^1/2; with Sárközy's lower construction, M(R) = R^1/2 +…

    candidate

    1 attempt

  • The Cone Theorem for Effective Fourfold Pairs in Characteristic p > 5The char-p minimal model program (Birkar, Hacon, Xu, Waldron and others)

    Extending the minimal model program beyond threefolds in positive characteristic is a standing goal of birational geometry. Assuming the log resolution conjecture for all log pairs birational to X, the cone theorem holds for projective log…

    partial

    1 attempt

  • Djament asked whether a Grothendieck category satisfying suitable finiteness and exactness conditions must be equivalent to a module category. In the locally noetherian case the answer is no: there is a Grothendieck category with a…

    partial

    1 attempt

  • The Covering Number C(12,6,4)covering design tables

    A t-(v,k,λ) covering is a family of k-subsets of a v-set meeting every t-subset at least λ times, and C(v,k,t) is the least number of blocks. The recorded bounds for C(12,6,4) were 40 ≤ C(12,6,4) ≤ 41. No 4-(12,6,1) covering with 40 blocks…

    solved

    1 attempt

  • Litvak conjectured in 2018 that for every p > 0 the quantity E[min_i ≤ n |g_i|^p], for g ~ N(0,Σ), is minimized over n × n correlation matrices by the Gram matrix of the regular simplex in R^n-1. False: the matrix Σ^cos_ij = cos(π(i-j)/n)…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • For a positive projection P on a Dedekind complete Banach lattice whose largest central operator below P is α id, Wickstead conjectured α must be 0 or 1/n for some natural n, and proved the finite-dimensional case. The paper proves the…

    solved

    1 attempt

  • Does every globally asymptotically stable homogeneous polynomial vector field admit a homogeneous polynomial Lyapunov function? No. A planar homogeneous cubic vector field with integer coefficients is globally asymptotically stable yet…

    disproved

    1 attempt

  • The Planar Steklov Analogue of Kac's QuestionThe Steklov analogue of Kac's question, raised in the Girouard-Polterovich problem literature, 2017

    Can one hear the shape of a drum, in the Steklov setting and in the plane? No: there exist pairs of noncongruent bounded plane domains with identical Steklov spectra including multiplicities, simply connected, strictly convex, with…

    disproved

    1 attempt

  • Signature of Connected Line GraphsSaieed Akbari et al., 2026

    Is the difference between the numbers of positive and negative adjacency eigenvalues of every connected line graph at most one? A 14-vertex witness has signature 2, and chaining copies gives connected line graphs of signature k + 1 for…

    disproved

    1 attempt

  • Erdős Problem #1091Paul Erdős, 1976

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Escobar, Klein and Weigandt proved that gradedness of an ASM weak order interval, constancy of Coxeter length across its fibres, and equidimensionality of the associated ASM varieties are mutually equivalent, and conjectured (Conjecture…

    solved

    1 attempt

  • Does every synchronizing one-cluster automaton on n states admit a reset word of length at most (n-1)^2? The new bound (m-1)(n-1) + mℓ ≤ (n-1)^2 settles the one-cluster case of the Černý conjecture.

    solved

    1 attempt

  • Sombor-Energy ConjectureNima Ghanbari, 2021

    Does every nontrivial finite simple graph have noninteger Sombor energy? If ρ_1,…,ρ_n are the eigenvalues of the Sombor matrix of a graph G, its Sombor energy is E_SO(G)=∑_i=1^n|ρ_i|. The conjecture asserted that E_SO(G)∉ Z for every…

    candidate

    1 attempt

  • Can a finite set of lattice points determine many rectangles but few isosceles triangles? Both parts of the governing question have negative answers, quantified by explicit blowup rates, and the resulting configurations give obstructions…

    disproved

    1 attempt

  • SOP_2 = SOP_3Mirna Džamonja, Saharon Shelah, 2004

    The classes of SOP_2 and SOP_3 first-order theories coincide. This answers a question of Džamonja and Shelah from 2004.

    solved

    1 attempt

  • For s ∈ (1/4,1) and any degree, the only W^s,1/s-minimizers among maps S^1 → S^1 are Blaschke products. This resolves Open Problems 23 and 24 of Brezis and Mironescu's book on mappings to the circle, and Brezis's Favorite Open Problem 5.4…

    partial

    1 attempt

  • Erdős Problem #1202Paul Erdős, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · a verdict recorded from elsewhere

  • The kissing number in 19 dimensions is at least 11948, improving the Cohn-Li bound by 256, via a binary code of length 19 and minimum distance 5 fed through the Cohn-Li odd-sign construction.

    partial

    1 attempt

  • The Imbalance ConjectureSergiy Kozerenko, Volodymyr Skochko, 2013

    The imbalance of an edge uv of a finite simple graph is the absolute difference of the degrees of u and v. Kozerenko and Skochko conjectured that the multiset of all edge imbalances is graphic - realizable as the degree sequence of some…

    solved

    1 attempt