Problems
No person has reviewed any of this; every judgement here is a machine's.
Every purely-maximal ideal of a commutative ring is purely-prime, and the converse holds for several important classes of rings; Tarizadeh conjectured (Conjecture 5.8 of his earlier published paper) that in a commutative ring every…
For a measurable set Ω⊂ R^3, let E(Ω)=P(Ω)+frac12iint_Ω×Ωdx dy/|x-y|, where P is De Giorgi perimeter, and set V_*=5frac2-2^2/32^2/3-1≈3.51. The conjecture asks for the complete fixed-volume minimization picture. Chodosh and Gianocca prove…
Define φ_k(n) = ∑_1 ≤ a ≤ n, (a,n)=1 a^k and D_s = k ≥ s : φ_s(n) | φ_k(n) for every n. Is D_1 = 1, 3, 15, as conjectured by Büyükaşik and collaborators?
Does a universal summation process recover the degree of a circle map from its Fourier moduli, that is, does ∑_n σ_n,ε n |hat f(n)|^2 → deg f hold for Holder maps below the threshold? No. For every 0 < α < 1/3 there is an f ∈…
For a designated face of an undirected unweighted planar graph, how many distinct distance patterns can vertices have? Li and Parter (STOC 2019) proved an upper bound; Mozes, Wallheimer and Weimann conjectured the true answer matches their…
For the three-dimensional paraboloid P_3 over a prime field in which -1 is not a square, the Fourier extension operator maps L^2 to L^r for r > 176/51 = 3.45098…, improving the exponent by combining a bilinear approach with point-line…
For a Brauer class on a variety, the period-index conjecture bounds the index in terms of the period and the dimension. Disproved: for any uncountable algebraically closed field k of characteristic 0 and any d ≥ 3 there is a d-dimensional…
Ciliberto, Knutsen, Lesieutre, Lozovanu, Miranda, Mustopa and Testa asked a question about effective divisors of positive self-intersection on smooth projective surfaces. The answer is negative, witnessed by a very non-movable effective…
A polynomial-time algorithm for computing an optimal committee under any Thiele voting rule on the Voter Interval domain, resolving a ten-year-old open problem posed for Proportional Approval Voting by Elkind and Lackner and later extended…
Does the analytic Bertini restriction theorem for multiplier ideals hold locally, outside a pluripolar exceptional set of fibers? Proved in full generality.
Simonovits conjectured that if a forbidden family F with p(F) > 1 has extremal number exceeding the Turan bound by a superlinear surplus, then its extremal graphs are joins of p graphs, each extremal for a family of chromatic number two.…
The BCHM theorem makes the log canonical ring of a projective klt pair finitely generated. Generalized pairs, introduced by Birkar and Zhang, add an auxiliary nef part and have become a central tool in birational geometry, so it is natural…
New upper and lower bounds on the approximation ratio achievable for Multiway Cut via large mixtures of new and old rounding schemes for the CKR relaxation, advancing the ratio ladder that has run since Călinescu-Karloff-Rabani (1998).
What is the minimax optimal error rate for density estimation when observations are perturbed by Wasserstein-bounded contaminations? Chao and Dobriban's 2023 preprint left a gap between upper and lower bounds; the sharp rate is now…
A group is Howson if the intersection of any two finitely generated subgroups is finitely generated, and strongly Howson if the rank of that intersection is bounded in terms of the two ranks. Zhang asked whether the two coincide for…
Baumslag asked whether a one-relator group G=F/⟨⟨ r⟩⟩ with r a commutator is Hopfian, residually finite or automatic. The paper constructs a family G_m=⟨ a,t | [t,a[a,t]^-m]⟩ answering all three negatively.
Let A(k) be the largest possible number of moves in a north-east lattice path whose visited vertices contain no k collinear points. Gerver (1979) and Gerver and Ramsey (1979) bounded A(k) by exp(Ω(log(k)^2)) ≤ A(k) ≤ exp(O(k^4)), and…
Korsky, Saffat and Aiylam bounded the growth constant c(G) for integer-valued Lipschitz functions on G(n,d/n) between 1/(2d) and 4log^2 d/d up to lower-order terms. The random-graph side is sharpened.
A graph on n vertices is very well-covered if every maximal independent set has size n/2. Levit and Mandrescu conjectured that the independence polynomial i(G,x) of every very well-covered graph is unimodal, i.e. its coefficient sequence…
Does a single ReLU neuron trained on modular addition align to one Fourier frequency? Open Problem MAIS-O60, itself posed by Claude Fable 5 under the direction of Lionel Levine, is answered negatively: an explicit construction reaches a…