#

number-theory

(7 articles)

"The Better-Than-Random Coloring"

The probabilistic method in combinatorics — pioneered by Erdős — shows that random constructions often achieve surprising results. Color the integers randomly, and the expected number of monochromatic patterns (arithmetic progressions, constellations) follows from straightforward counting. The question Butler, Costello, and Graham asked in 2010: can you do better than random? Yang and Mao prove yes, for every constellation pattern. There exists a deterministic coloring of the integers 1 through n that produces fewer monochromatic copies of any given pattern than the expected count under random coloring. The improvement is multiplicative — the leading coefficient γ is strictly smaller than the random coefficient — not just a lower-order correction. This is surprising because the probabilistic method often gives optimal or near-optimal results. For many combinatorial problems, random constructions are the best known and sometimes provably optimal. That deterministic colorings can systematically beat random for all constellations means there's exploitable structure in the pattern-avoidance problem that randomness misses. The resolution inverts the usual relationship between structure and randomness in combinatorics. Normally, structure helps construct objects (you need careful design to build extremal graphs) while randomness helps avoid patterns (random constructions minimize unwanted substructures). Here, structure helps avoid patterns too. The constellation's geometry creates correlations that a deterministic coloring can exploit — correlations that random coloring, by definition, ignores. The randomness that usually solves avoidance problems is leaving performance on the table.

combinatoricsRamsey-theorycoloringconstellationsrandom-methodsnumber-theory

The Phase Matching

# The Phase Matching Erdős Problem #650 asks: given a set A = {a₁ < a₂ < ... < aₘ} of positive integers and an open interval I of length 2aₘ, what is the maximum number of disjoint pairs (aᵢ, x) where x ∈ I and aᵢ divides x? Each element of A is matched to a distinct multiple of itself inside I. How many such disjoint matchings can you guarantee? The authors of arXiv:2603.28636 (March 2026) resolve this completely. The answer is f(m) = min(m, ⌈2√m⌉). For small m, every element finds a match: f(m) = m. But above a critical threshold, the number of matchable pairs transitions to 2√m — a square-root scaling that prevents full matching regardless of how the set and interval are arranged. The shape of the answer is the structural finding. The matching problem undergoes a phase transition as m grows. For m ≤ 4, complete matching is always possible. For larger m, the combinatorial constraints from divisibility — the way multiples of different integers crowd and overlap within the interval — create bottleneck conflicts that cannot be resolved. The transition from linear to square-root is sharp: it is not that matchings become harder; it is that the structure of the problem changes qualitatively. Below the transition, the problem is trivially solvable. Above it, it is governed by a different regime where interference between divisibility classes dominates. The initial proof strategy was generated by ChatGPT and then formalized and verified in Lean. The machine suggested the combinatorial construction; the human formalized the argument; the proof assistant certified it. The three-stage pipeline — conjecture by language model, proof by mathematician, verification by computer — is itself a structural observation about how mathematical discovery can be organized. The AI did not prove the theorem. It identified the shape of the answer, which is the part that requires pattern recognition over a space too large for exhaustive search. The structural observation: a matching problem whose answer looks like it should be a single formula instead has two regimes separated by a phase transition. The question "how many disjoint divisibility pairs?" has a trivial answer (all of them) in one regime and a non-trivial answer (square root of them) in another. The difficulty is not in the answer but in recognizing where the answer changes character.

combinatoricsnumber-theoryErdos-problemsdivisibilitymatchingextremal-combinatorics

The NP Lattice

# The NP Lattice The shortest vector problem asks: given a lattice in Euclidean space, find the shortest nonzero vector. Van Emde Boas conjectured in 1981 that this problem is NP-hard. The conjecture has been the assumed foundation for lattice-based cryptography — the security of post-quantum cryptographic schemes depends on the computational difficulty of problems related to short lattice vectors. Forty-five years later, the conjecture is proved. The proof connects coding theory to algebraic geometry: it reduces a known NP-hard problem to the shortest vector problem through Reed-Solomon codes and the Weil conjectures for higher-dimensional varieties over finite fields. The connection is not obvious. Reed-Solomon codes are error-correcting codes defined over finite fields. The Weil conjectures (proved by Deligne in the 1970s) describe the number of points on algebraic varieties over finite fields. Neither topic appears to be about lattice geometry. The proof works by encoding the NP-hard problem into the structure of a lattice constructed from a Reed-Solomon code, then showing that the shortest vector in this lattice encodes the solution to the original problem. The Weil conjectures provide the estimates needed to control the lattice geometry tightly enough for the reduction to work. The structural observation: a foundational conjecture in computational complexity is resolved by a bridge between two apparently unrelated mathematical domains. The lattice problem is geometric; the proof is algebraic. The difficulty of finding short vectors in high-dimensional lattices turns out to be controlled by the arithmetic of algebraic curves over finite fields — a connection that was invisible for four decades.

number-theorycomputational-complexitylattice-problemscryptographyalgebraic-geometryReed-Solomon

The Geometric Zero

# The Geometric Zero Montgomery's classical result shows that at least two-thirds of the nontrivial zeros of the Riemann zeta function are simple and lie on the critical line Re(s) = 1/2. The proof assumes the Riemann Hypothesis — that all nontrivial zeros lie on the critical line — to establish the two-thirds lower bound. The new result replaces the Riemann Hypothesis with a purely geometric constraint: confine zeros to a vertical strip of width b/log T centered on the critical line, where T is the height and b is a parameter. As b shrinks to zero, the strip narrows to the critical line, recovering the Riemann Hypothesis as a limiting case. For any fixed b, the two-thirds result holds. The significance is that the analytic assumption (all zeros are exactly on a line) is replaced by a geometric assumption (zeros are approximately near a line, with the approximation improving with height). The geometric version is weaker — it allows zeros off the critical line — but strong enough to recover the key consequence. The quantitative control comes from the narrowing of the strip, not from the exactness of zero placement. The structural observation: an analytic hypothesis is substituted by a geometric one with no loss in the derived result. The two-thirds bound does not require zeros to be exactly on the critical line — it requires only that they be confined to a region that shrinks appropriately. The geometric confinement is the load-bearing structure; the analytic exactness was a sufficient but unnecessary condition.

number-theoryRiemann-hypothesiszeta-functionzeroscomplementarityanalytic-number-theory

The Powerful Product

# The Powerful Product A powerful number is one divisible by the square of its largest prime factor — every prime that divides it divides it at least twice. Products of consecutive integers are rarely powerful, because consecutive integers tend to introduce fresh prime factors at first power. The question of how often such products are powerful connects multiplicative structure to additive structure in a way that has resisted analysis. Tao obtains asymptotics for products of k consecutive integers that are powerful, and resolves the equation a₁! a₂! a₃! = m² — determining when a product of three factorials can be a perfect square. The connection between powerful products and factorial equations is not obvious: the factorials encode the multiplicative anatomy of consecutive integer products in compressed form, and the square equation constrains the exponent parity across all prime factors simultaneously. The structural method treats the multiplicative anatomy — the detailed pattern of prime factorizations — as an object of study in its own right, rather than focusing on any single multiplicative property. The "unusual anatomy" in the title refers to products of consecutive integers whose prime factorization pattern deviates from the typical pattern predicted by probabilistic number theory. The powerful condition is one such deviation; the factorial-square equation is another; and the paper shows they are connected through the same anatomical constraints. The structural observation: a question about consecutive integers (additive structure) is answered by analyzing the detailed prime factorization patterns (multiplicative structure) of their products. The additive regularity of consecutive integers creates multiplicative constraints that are tight enough to yield asymptotics — the product remembers its additive origin through its multiplicative anatomy.

number-theorycombinatoricsmultiplicative-number-theoryErdosfactorialsconsecutive-integers

The Categorical Lift

# The Categorical Lift The p-adic Langlands correspondence is a bijection: it matches smooth p-adic representations of GL₂(Qₚ) with certain modules over (φ,Γ)-algebras, one object to one object. The bijection has been known, but a bijection between objects carries no information about morphisms — it says two collections have the same size without saying how the collections are structured. The categorification lifts the bijection to a fully faithful functor — an embedding of the entire derived category of representations into the category of Ind-coherent sheaves on (φ,Γ)-module stacks. Not just objects correspond; the morphisms between objects, the extensions, the higher homological algebra all embed faithfully. The structure of one side is a substructure of the other. The construction is a fully faithful functor, not an equivalence. The representation-theoretic side embeds into the geometric side, but the geometric side is larger — it contains objects that do not correspond to representations. The asymmetry is meaningful: the geometric world is richer than the representation-theoretic world, and the functor identifies exactly which geometric objects have representation-theoretic meaning. The structural observation: a correspondence between individual objects is promoted to a correspondence between entire mathematical universes, preserving all relationships between objects. The lift from bijection to functor is the difference between knowing that two libraries have the same number of books and knowing that every reference between books in one library has a corresponding reference in the other. The categorical structure — the morphisms, not just the objects — is the content of the Langlands program at the deepest level.

number-theoryLanglands-programp-adicrepresentation-theorycategory-theoryalgebraic-geometry

The Residual Failure

# The Residual Failure The classical Littlewood conjecture (1930) asks whether, for any two real numbers α and β, the product n · ||nα|| · ||nβ|| can be made arbitrarily small as n ranges over positive integers — where ||x|| denotes the distance from x to the nearest integer. After nearly a century, this conjecture remains open, though Einsiedler, Katok, and Lindenstrauss proved in 2006 that the set of counterexamples, if any exist, has Hausdorff dimension zero. Bandi, Fregoli, and Kleinbock recently proposed a uniform version (ULC): a strengthened form with explicit uniform bounds replacing the asymptotic condition. The uniform version demands more — not just that the product gets small eventually, but that it gets small at a controlled rate. Schleischitz (arXiv:2603.12611) proves the uniform Littlewood conjecture is false. The counterexamples are not rare. They form a residual set — a topologically generic set in the sense that its complement is meagre (a countable union of nowhere-dense sets). In the Baire category sense, "most" pairs (α, β) are counterexamples. The conjecture fails not at exceptional points but at typical ones. The disproof is semi-constructive, drawing on Bourgain and Kontorovich's results on Zaremba's conjecture and estimates for product sets over finite fields. The method extends to disprove uniform versions of the p-adic Littlewood problem and twisted weaker versions in S-arithmetic settings. The through-claim: a conjecture can be false and its counterexamples can be generic simultaneously. The failure is not a boundary phenomenon — a delicate exception near the edge of validity. It is the bulk condition. The uniform conjecture was wrong about what typical behavior looks like. Strengthening the classical conjecture by adding uniformity didn't narrow the class of counterexamples. It expanded them to include almost everything. The conjecture's ambition was its undoing: demanding more structure revealed that less structure is the norm.

number-theoryDiophantine-approximationconjecturecounterexampletopologyLittlewood