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

Ziegler proved every simplicial d-dimensional 0/1-polytope has at most 2d vertices, and asked whether attaining 2d vertices forces central symmetry (i.e. a 0/1 cross-polytope). Known true for d ≤ 6; open since ~2000.

Lions asked whether the variational solution of a non-autonomous divergence-form problem has maximal L2-regularity under Holder continuity in time of the coefficients. Disproved at the half-Holder endpoint: a bounded, uniformly elliptic,…

Mauri and Moraga posed a two-part question about log Calabi-Yau pairs whose boundary decomposes into big divisors. Both parts have negative answers.

Does every lattice of density above one admit a Gabor frame with a nice window? No. For every dimension d > 1 there are explicit criteria on lattices Λ ⊂ R^2d with D(Λ) > 1 such that no function with continuous Zak transform generates a…

The paper exhibits an explicit integer polynomial in five variables, of total degree 14 with constant Hessian determinant 128, whose gradient is not injective. Its formal Legendre transform is therefore not a polynomial, so the Hessian…

Curto et al. (Advances in Applied Mathematics, 2024) conjectured that every stable fixed point of a threshold-linear network is minimal. Disproved: an explicit competitive 3-neuron TLN has a stable fixed point whose support strictly…

Kollár and Kovács asked whether the first cohomology of the structure sheaf of the fibers must be constant for a flat projective morphism to a smooth curve whose fibers are Cohen-Macaulay and reduced and whose generic fiber is smooth. It…

A Cayley graph is minimal when no proper subset of its connection set generates the group. Babai asked whether minimal Cayley graphs have bounded chromatic number. Resolved negatively: finite minimal Cayley graphs exist with arbitrarily…

For every connected graph, is the variance of its positive adjacency eigenvalues at most its order divided by its average distance? Exact dumbbell-graph certificates refute the bound under both conventions for average distance.

For a differential poset P, must the weighted 2-multichain series M_P,2(q) be a rational multiple of F_P(q)^2, the square of its rank generating series?

Is the zero forcing number of every connected graph with maximum degree 3 at most its independence number plus one? A connected 24-vertex subcubic graph with independence number 9 and zero forcing number 11 refutes this 2017 TxGraffiti…

Holevo and Werner's 1999 lower bound on the quantum capacity of the bosonic thermal attenuator comes from thermal inputs. Is it optimal? The paper proves it is exactly the supremum over single-mode Gaussian states, then exhibits a…

For the integral I(h) over the unit interval and the torus, the paper gives the three-term Laurent polynomial f(x,z)=(1-z^-1)((1-x)+xz) with I(f^n)=0 but I(z^-1f^n)=(-1)^n-1/(n+1)≠0. This disproves the xz-conjecture with one interval and…

For every smooth positive density f on R^d, must the Fisher information t ↦ I(f * γ_t) be log-convex along the heat flow?

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.

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…

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.

Is a Werner state that is not one-copy distillable ever two-copy distillable? The first open rung of the NPT bound-entanglement ladder, open since 2000.

If G is connected, cubic and diamond-free, must the zero-forcing number satisfy Z(G) ≤ γ(G) + 2? A connected cubic triangle-free 14-vertex graph has Z = 7 and γ = 4.