Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For every rational α∈[1,2), there exists a finite bipartite graph G such that ex(n;G)=Θ(n^α). Equivalently, every rational exponent between 1 and 2 occurs as the order of growth of the Turán number of a single bipartite graph.
For the Kasami APN function F(x) = x^4^k - 2^k + 1 on GF(2^n) with gcd(k, n) = 1, the conjecture asserts that for Δ = F(b) + F(b+1) + 1 and all distinct nonzero v_1, v_2, the number of triples in Δ^3 with v_1 x + v_2 y + (v_1 + v_2) z = 0…
Question 6.1 of Chalmoukis, Tsikalas and Yakubovich asks how far the Power boundedness constant P(T) of a matrix can exceed its ordinary Kreiss constant K(T). Answered more strongly: for every K > 1 there are matrices whose Cayley…
subDL is a logic developed for paraconsistent mathematics by Zach Weber (2021), combining elements of relevant logic and affine logic. Tore Øgaard (2026) shows that subDL satisfies two important relevance properties: the signed…
It is proved that, for every δ∈(0,1), the Glauber dynamics for the uniform distribution on proper q-colorings is rapidly mixing when q≥(1+δ)Δ and the underlying graph has girth at least 5 and maximum degree Δ=Ω_δ(1). This result also…
Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length L in a convex body Ω can match the Crofton-predicted line-intersection counts, and proved an O(L^1/3) upper bound via a…
Let ξ=∑_a,c≥ 0frac12^a3^c 2^2^a3^c, the value at 1/2 of Dibag's logarithm localized at the primes 2 and 3; summing the same terms over every positive integer rather than only the 3-smooth ones gives log 2. Is ξ normal in base two, that is,…
How large can the Mordell-Weil rank of an elliptic curve over Q be? Whether ranks are unbounded is open, and progress is measured by explicit records, tabulated by Dujella: rank ≥ 28 from 2006, raised to ≥ 29 by Elkies and Klagsbrun in…
Willie Wong asked on MathOverflow in April 2016: if f: R^n→ R^n is a bijection that maps every connected set to a connected set, must f^-1 do the same? By Tanaka's theorem and invariance of domain this is equivalent to asking whether every…
The basis number bn(G) of a graph G is the minimum edge-congestion of a basis of its cycle space. We prove that every finite n-vertex multigraph satisfies bn(G)=O(log n), resolving, for simple graphs, a question of Bazargani, Biedl, Bose,…
A pure state of n parties with q levels each is absolutely maximally entangled, written AME(n,q), when every subsystem of at most ⌊ n/2 ⌋ parties is maximally mixed. These are the perfect tensors, and existence is a parameter-by-parameter…
Let S be the set of square-free integers in [2, n] and G = PR[S] the graph on S in which two integers are adjacent when they are not coprime. From the cases n ≤ 100 and about twenty further values n ≤ 200, Graffiti conjectured that the…
Can a solution of the three-dimensional incompressible Euler equations on R^3, started from smooth data and driven by a force that is smooth in space and time up to and including the blowup time, lose regularity in finite time? Finite-time…
For every base b≥2, the number of prime factors of the λ-digit base-b palindromes, and of the base-b reversals of the λ-digit primes, obeys an Erdős–Kac law: counted with or without multiplicity, it is asymptotically normal with centring…
Determine the exact proper hat-guessing number of the complete graph on six vertices with one edge removed. The known general bounds leave HG_P(K_6-e)∈9,10.
Let f(n) be the least m for which n! can be written as a_1… a_k with n < a_1 < … < a_k = m - the smallest possible largest factor in a factorization of n! into distinct integers all exceeding n. Erdős, Guy and Selfridge proved f(n) - 2n…
Erdős, Hajnal and Szemerédi asked whether, for every function f(n)→∞, however slowly, there exists a graph of infinite chromatic number such that every finite n-vertex subgraph can be made bipartite by deleting at most f(n) edges. The…
Smale conjectured that in his mean value theorem for complex polynomials, the universal constant 4 could be replaced by 1. Equivalently, for every complex polynomial p of degree at least 2 and every z∈ C, there should exist a critical…
What is the exact value of the complex Grothendieck constant K_G^ C, the least K such that |∑_i,ja_ij⟨ x_i,y_j⟩|≤ Kmax_|ε_i|=|δ_j|=1|∑_i,ja_ijε_iδ_j| for every complex matrix (a_ij) and all unit vectors x_i,y_j in any complex Hilbert…
Córdoba and Martínez-Zoroa proved finite-time singularity formation for the two-dimensional incompressible porous media equation from smooth initial data with a force smooth in space but merely bounded in time, that is in L^∞_t C^∞_x.…