VibeMathed

Araujo, Piga and Schacht asked whether density and codegree both above 1/4 force a tight Hamilton cycle in a linearly quasirandom 3-graph. No: the threshold is p_0 = max_0 ≤ x ≤ 1minx^3, 1-x ≈ 0.3177, and below it there are dense 3-graphs…

Does the Kannan-Lovász-Simonovits variance inequality hold with a universal constant for every quadratic form of an isotropic log-concave random vector - that is, is Var⟨ MX, X⟩ ≤ C E|∇⟨ MX, X⟩|^2 for every symmetric M?

For D_3(m) = vecC_m square vecC_m square vecC_m, can the full arc set be partitioned into three directed Hamilton cycles for every integer m ≥ 3?

Han and Jiang asked whether being of klt type is an open condition in flat families of varieties. It is not.

Among sufficiently large one-separated planar point sets, does the triangular lattice maximize the number of distances below each threshold? Explicit rational oblique lattices beat the triangular lattice under several closed- and…

For a pure O-sequence h = (h_0, …, h_e) of codimension three and type two, is h_i^2 ≥ h_i-1 h_i+1 for every interior index i? The stated monomial case is proved; the broader level-Hilbert-function case remains open.

Swinnerton-Dyer (1981) proved R-equivalence trivial on smooth cubic surfaces over p-adic fields with good reduction, except for three special types. The paper resolves two long-standing exceptional cases: triviality for the diagonal cubic…

For a transcendental entire function, how fast can |f(z)| be forced to grow along a path to infinity, and how short can such a path be in terms of the maximum modulus M(r, f)?

For every finite connected simple graph G, is the order of the largest induced tree at least girth(G) - 1 + ecc(G, center(G)), where the last term is the eccentricity of the centre set? Answered affirmatively, with a Lean proof.

Given planks of fixed total width, how should they be placed to cover as much of a convex body's volume as possible? Karoly Bezdek asked whether, for a Euclidean ball, the optimum is a single plank centred at the origin. It is, and the…

A cyclic meander induces a cyclic permutation on its 2n marked intersection points. Schwartz's conjecture on the quadratic growth of the associated meander number is resolved.

Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than 1?

For every finite connected graph, is girth(G) + 1 at most the product of its largest induced-tree order and its second-smallest degree?

For an inclusion-free hypergraph on n vertices, a weight assignment w:[n]→[d] is isolating when a unique edge attains minimum weight. Faber and Harris conjectured that the number of isolating assignments is at least n∑_j=0^d-1 j^n-1,…

The low-degree conjecture predicts that when the low-degree advantage between a planted distribution and a uniform null distribution stays bounded, no polynomial-time algorithm can distinguish them. It is false. There is a planted…

Given n and 1 ≤ c ≤ n!, can n distinct group elements be chosen so that their n! ordered products take exactly c distinct values? Constructions realize every c.

Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in sparse convex optimization cannot be improved by a polynomial-time algorithm. Their conjectured lower bound is established for…

Norine conjectured that every red-blue edge-colouring of the n-dimensional hypercube Q_n in which antipodal edges get opposite colours contains a monochromatic path from some vertex to its antipode. The paper proves it, via a chain-level…

Arjevani et al. asked whether almost-surely bounded oracle error permits a better rate than bounded variance for smooth nonconvex stochastic optimization. It does not: every randomized adaptive algorithm still needs Omega(dL/eps^2 + dL…

Sivaraman asked whether perfect divisibility is characterized by its chromatic consequence: is a graph G perfectly divisible if and only if χ(H) ≤ binomω(H)+12 for every induced subgraph H of G? False: the Paley graph P(17) satisfies the…