Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Put N=2^k-1 and write wt for the binary Hamming weight. Let F_k(t) count the ordered triples (a,b,c)∈0,…,N-1^3 with a+b+c≡ t pmod N and wt(a)+wt(b)+wt(c)<k, the three-summand analogue of the two-summand count of the Tu-Deng conjecture at…
Let H_t be the heat-flow deformation of the Riemann ξ function and Λ the de Bruijn-Newman constant: the zeros of H_t are all real exactly when t ≥ Λ. The Riemann hypothesis is the statement Λ ≤ 0, and Rodgers and Tao proved Newman's…
Classify the finite simple graphs of minimum degree at least five whose cycle lengths fail to represent every residue class modulo five. Is residue two the only possible missing residue, and can all such graphs be characterized through an…
The first rigorous solid standard Young tableaux challenge asks for a proof of a conjectured second-order recurrence for the number of solid standard Young tableaux. The conjectured recurrence is proved.
A textbook result in information theory is that linear encoders achieve the entropy for lossless compression of Bernoulli source with parameter p. For lossy compression, however, linearity is known to incur strict suboptimality compared to…
A single layer of independent random single-qubit Clifford gates is negl(n)-distinct for polynomially many queries. Consequently, in the PFC pseudorandom-unitary construction, the depth-log n global unitary 2-design layer can be replaced…
How large can the gap between consecutive primes be, infinitely often? Writing log_k for the k-fold iterated logarithm, Erdős asked (problem #4, a $10,000 prize) whether p_n+1-p_n ≫ Clog nlog_2 nlog_4 n/(log_3 n)^2 for every C; that was…
Let r≥2, s≥1 and n≥ r(s+1) be integers. If F⊆binom[n]r contains no s+1 pairwise disjoint members, must | F|≤maxbinomr(s+1)-1r,binom nr-binomn-sr? The two candidate extremal families are all r-sets inside an (r(s+1)-1)-set and all r-sets…
A number of spin chains are solvable by hidden free-fermionic structures that go beyond the Jordan-Wigner transformation, the family known as "free fermions in disguise". Every example in the literature shared an awkward feature:…
We construct a real meromorphic function F on C such that F^-1(0,1,∞)⊂R, while F is not of bounded type in either half-plane. More strongly, for every a∈widehatC∖0,1,∞, the a-point divisor in either half-plane fails the Blaschke condition.…
Let p be prime, k,n≥ 1, and R= Z/p^k Z. For each primitive direction b∈ P(R)^n-1 modulo multiplication by units and each λ∈ R, let H_b,λ=x∈ R^n:⟨ b,x⟩=λ, and let A(p^k,n) be the 0-1 matrix whose rows are the indicators of these distinct…
Let G be a finite simple graph with m=|E(G)| edges and clique number ω(G), and let λ_1(G)≥λ_2(G)≥…≥λ_n(G) be the eigenvalues of its adjacency matrix. Bollobás and Nikiforov conjectured in 2007 that every non-complete graph satisfies…
Let Γ be a property (T) group admitting an injective, non-surjective endomorphism and let G be the associated ascending HNN-extension. Let W=(bigoplus_G/Γ Z/2 Z)rtimes G. We show that W is not an MF group and that C^*(G) is not a finite…
Let n>2. We construct a map U∈ W^1,n(B^n,R^n+2) that is discontinuous at the origin and smooth on the punctured ball B^n ∖ 0, together with an antisymmetric potential Ω∈ L^n(B^n,so(n+2)⊗R^n) such that -Div(|∇ U|^n-2∇ U)=Ω· |∇ U|^n-2∇ U in…
Bugeaud's Problem 10.61, due to Michel Mendès France in 1967: for a Pisot number α > 2 and the Cantor set C(α) = (α-1)∑_k≥1ε_kα^-k : ε_k ∈ 0,1, no ξ ∈ C(α) has (ξα^n)_n≥1 uniformly distributed modulo one. The problem itself remains open.…
Koizumi and Liu conjectured that for every real hyperplane arrangement A, the coefficients of Mag( A;-t) are eventually nonnegative, equivalently that the coefficients of Mag( A;q) eventually alternate in sign. The conjecture is false.…
Every finite simple connected graph G with |V(G)|=2d+1, diam(G)=d≥ 3 satisfies W(G)≤ W(C_2d+1) =frac(2d+1)d(d+1)2. The claimed equality cases are exactly C_2d+1 for every d≥3, the double star D_2,3 when d=3, and the nine-vertex tree…
A finite set A⊆1,…,N is sum-distinct if all subset sums ∑_a∈ S a, S⊆ A, are distinct. Erdős asked whether there is an absolute constant C>0 such that every sum-distinct set A⊆1,…,N satisfies N>C 2^|A|. The conjecture is false: for every…
In 1966, McKean asked whether the entropy production of the Boltzmann equation must be monotone decreasing in time. We show that this is not the case even in the space-homogeneous setting for the Boltzmann collision operator with a…
Although Courtade’s conjecture was originally formulated for general convex bodies, we show that it fails even for zonoids in every dimension at least three.