An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Moraga conjectured, and Kollár and Zhuang recorded, an odd-dimensional extension of the rank bound for faithful abelian p-group actions on smooth Calabi–Yau varieties. The paper disproves it.

Let k≥ 3 and A be an additive basis of order k. Does there exist a constant c=c(k)>0 such that if r(n)≥ clog n for all large n (where r(n) counts representations of n as a sum of at most k elements of A) then A must contain a minimal basis…

The conjecture that volume is log-submodular under Minkowski addition on zonoids, that is |A||A+B+C| <= |A+B||A+C|. Disproved by a four-dimensional zonotope generated by a 2-modular matrix together with two segments. Several related local…

da Silva Machado and Seade conjectured that weighted homogeneous isolated hypersurface singularities are exactly those admitting a logarithmic vector field transverse to the link. True: for a reduced isolated hypersurface germ in C^n+1…

In the square Gaussian binary MIMO model y = √ρ/N Hx^⋆ + w, exhaustive maximum-likelihood detection recovers x^⋆ once ρ > 2log N, while sphere decoding at that threshold scale costs expΘ(N/log N). Whether any polynomial-time detector…

Does bipartite bound information exist: classical correlations between two parties and an eavesdropper that cost secret bits to create, yet from which no secret key can ever be distilled?

For every real ξ>0 the sequence of integer parts [ξ 7^n], n=0,1,2,…, contains infinitely many composite numbers. Second, there is no infinite right truncatable prime in base~7.

Prim-Dijkstra routing interpolates between a minimum spanning tree and a shortest-path tree, and has been used and improved in VLSI physical design since the early 1990s, but the complexity of the terminal-only Manhattan decision problem…

The paper proves a closed-string remodeling statement for the affine binary dihedral Calabi–Yau orbifold threefold, a target outside the toric setting of the Bouchard–Klemm–Mariño–Pasquetti remodeling conjecture, replacing the toric mirror…

What is the optimal uniform continuity bound for quantum conditional entropy in trace distance, depending only on the dimension of the conditioned system? The sharp bound h_2(δ) + δ log(d^2 - 1) up to δ = 1 - d^-2, conjectured by Wilde, is…

The quartet distance counts the four-leaf subsets on which two binary phylogenetic trees display different topologies. Bandelt and Dress conjectured the maximum over trees on n leaves. Proved: it is (2/3 + o(1))binomn4, by reducing…

Coble and Barg introduced binary Coxeter codes, the span of indicators of standard cosets of fixed rank in a finite Coxeter system, generalizing Reed-Muller codes, and proposed a conjectural value for the minimum distance of a general…

Regev and Stephens-Davidowitz conjectured that Z^n maximizes the Gaussian mass Θ_L(t) = ∑_x ∈ L e^-t|x|^2 over stable lattices for every t > 0. The sharp inequality holds for every integral unimodular lattice of rank n ≤ 32, with equality…

Kawauchi conjectured that the Conway polynomial of an amphicheiral knot factors as ∇_K(z) = f(z)f(-z) for an integer polynomial f. Hartley proved it for negative amphicheiral knots and Ermotti, Hongler and Weber published the first…

The dissipative barrier method suppresses spectral pollution when a differential operator is truncated, but can it hide genuine spectral points? Known as the graveyard problem, the question stayed open in dimension two and above for more…

Given n independent standard Gaussian vectors in R^d, an ellipsoid fit is a positive semidefinite S with x_i' S x_i = d for every i. Saunderson, Parrilo and Willsky conjectured that this semidefinite feasibility problem has a sharp…

Donner proved in 1992 that the list color function P_ℓ(G,k) equals the chromatic polynomial P(G,k) once k is large. Kaul and Mudrock asked whether the analogue holds for Hanlon's unlabeled chromatic polynomial, and could not settle even…

A monic prime P of F_q[T] is a c-Wieferich prime if ρ_P(1) ≡ 1 bmod P^2 for the Carlitz module ρ. On limited data and proofs in degrees 2 and 3, Thakur suggested in 2015 that in odd characteristic every c-Wieferich prime has degree…

Does the Benjamini-Hochberg procedure always control the false-discovery rate at its nominal level for correlated two-sided Gaussian p-values? A factor model gives FDR > 0.0104 at nominal level α = 0.01.

For the set of n by n doubly stochastic matrices, Kim and Roush conjectured in 1981 that for odd n = 2k+1 > 1 the maximum of per(I-A) equals 3 times 2^(k-2), attained by an explicit block construction. Proved in full, and the maximizers…