Problems

Ballantine, Beck, Feigon and Maurischat introduced the subsum polynomial sp(λ,x) := ∏_i (1+x^λ_i) attached to an integer partition λ, studied rational functions built by summing reciprocals of these polynomials over natural classes of…

There exists a Hadamard matrix of order 668: a matrix H∈-1,1^668×668 such that HH^ T=668I_668. Equivalently, the 668 rows of H are pairwise orthogonal.

How large can a Bruhat interval in S_n that is a poset hypercube be? Using a permutation pattern suggested by AlphaEvolve, the authors exhibit hypercube intervals of dimension O(n log n) for n a power of 2, matching the largest possible…

Subbarao and Verma asked in 1999 (Problem 5.7, first part) whether the complementary Bell numbers f(n) = B_n(-1) take any given value only finitely many times. Campbell proves they do: for every fixed integer the fiber is finite, a result…

Conjectures that every bridgeless graph has a collection of cycles covering each edge exactly twice.

Let n_k be the least n > 2k such that (n-k)(n-k+1)…(n-1) has no prime factor in (k, 2k). Erdos conjectured a superpolynomial lower bound; for all large k, n_k > e^log^2 k / (20 loglog k).

The Gaussian Moments Conjecture asks whether, for complex polynomials P,Q in n independent standard real Gaussian variables, E(P^m)=0 for all m≥ 1 forces E(QP^m)=0 for all large m. Explicit counterexamples with E(P^m)=0 and E(QP^m)=m!≠ 0…

If A is a forbidden-divisor set with |A ∩ [1,x]| = o(√x) and B = b_1 < b_2 < … the sifted set, must x^-1 ∑_b_i < x (b_i+1 - b_i)^2 converge to a finite limit?

Erdos and Szemeredi conjectured that every finite set of reals satisfies max(|A+A|,|AA|) ≥ |A|^2-o(1). False: there are arbitrarily large A ⊂ R, of algebraic integers in a number field of degree asymp log|A|, with max(|A+A|,|AA|) ≤ |A|^2-c…

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

A collection of open problems drawn from published lists, including Cahen, Fontana, Frisch and Glaz's Open Problems in Commutative Ring Theory and Erman and Sam's survey of Boij-Soderberg theory, each proved or disproved by one automated…

If h(r) is the maximal finite exact order attainable by an additive basis of order at most r, what is lim_r → ∞ h(r)/r^2? The candidate proof identifies the sharp limit 1/3.

For every δ > 0 and infinitely many n there is a set of n lines in the plane with no intersecting quadruple such that every subset of size at least n^4/5+δ contains three concurrent lines. This improves the bound for a dual form of a…

A problem from Fajtlowicz's Graffiti program, studied by Erdős and Staton, on the Havel-Hakimi residue of common-divisor graphs. The paper resolves the problem and extends it, determining the residue's first-order scale and its nontrivial…

Two degree inequalities for circle-valued Sobolev maps have constants that degenerate as p → 1^+ or δ → 0^+. Brezis posed the problem of sharpening them; both are now sharpened, by the same power trick with elementary estimates.

For every n≥2 the paper exhibits an n-dimensional K-polystable toric Q-Fano variety whose alpha invariant is exactly 2/2n+1, answering a question of Liu and Zhuang on whether a K-semistable example exists with alpha invariant between 1/n+1…

For the least k at which the small-prime part of binomnk exceeds n^2, how large can f(n) be?

For A ⊂ F_p of density 1/2, call A almost affine invariant under φ(x) = ax+b if |A triangle φ(A)| = o(p). Problem 90 asks for the threshold K below which A can be almost affine invariant simultaneously under all such φ with |a|, |b| ≤ K…

Tuza conjectured that every finite simple graph satisfies τ(G) ≤ 2ν(G), where ν counts pairwise edge-disjoint triangles and τ is the fewest edges whose deletion leaves the graph triangle-free. Puleo had proved it for maximum average degree…

Nazarov conjectured that for s ∈ (1, 3/2) the quadratic form of the spectral fractional Dirichlet Laplacian strictly increases under u ↦ |u| when u changes sign. Proved and substantially generalized, with the same conclusion for the…