László Lovász 2026-11-05
László Lovász is a mathematician whose work connects combinatorics, graph theory and efficient algorithms. With Arjen K. Lenstra and Hendrik W. Lenstra, he developed the LLL algorithm, which replaces a basis of a Euclidean lattice by a more geometrically controlled basis of the same lattice. Their 1982 paper uses lattice reduction to factor polynomials over the rational numbers in polynomial time.[ref]
The point of reduction is not to change the lattice: integer basis changes preserve it. Instead, shorter, better organized vectors expose relations hidden by a poor basis. This is a striking bridge from geometric reasoning to exact algebraic computation. Lovász shared the 2021 Abel Prize with Avi Wigderson for contributions linking discrete mathematics and theoretical computer science.[ref]
Figure 1.
László Lovász; photograph by Peter Badge, Abel Prize laureate page
.
Lloyd Shapley Created 2026-10-18 Updated 2026-11-05
Lloyd Shapley was a mathematician whose work helped shape game theory and the mathematical study of matching markets. His research on stable matching with David Gale supplied an existence theorem and a constructive procedure, while the Shapley value gives a systematic way to allocate the value created by cooperation.[ref] The Shapley value averages each participant's marginal contribution over all orders in which a group might form. This makes a fairness rule precise through combinatorics, rather than selecting a division solely by bargaining strength or an arbitrary order of arrival.
Louis H. Kauffman 2026-11-05
Louis H. Kauffman studies knot theory and its connections with statistical mechanics, quantum theory and combinatorics. His University of Illinois at Chicago research page identifies these connections.[ref]
His Kauffman bracket computes a polynomial by resolving each crossing into simpler diagrams and combining the resulting states. A correction using the diagram's writhe produces the Jones polynomial. The construction explains how a local crossing rule can yield a global invariant of a knot and gives applications to reduced alternating diagrams.[ref]
Nicholas J. Williams Created 2026-10-18 Updated 2026-11-05
Nicholas J. Williams studies representation theory for finite-dimensional associative algebras and its connections to combinatorics. His research connects partially ordered sets and triangulations of convex polytopes with the structure of finite-dimensional algebras, including quivers and homological algebra. This interaction allows combinatorial order and geometric decomposition to encode relationships between algebraic objects.[ref]
Identity source: nchlswllms.github.io/
Nicolaas Govert de Bruijn 2026-11-05
Nicolaas Govert de Bruijn worked on combinatorics and mathematical structures. With Paul Erdős, he proved a finite incidence theorem in their 1948 paper: a nontrivial system in which each pair of points lies on exactly one line has at least as many lines as points.[ref]
The equality cases are highly organized: a near-pencil or a finite projective plane. This shows how a local pair-incidence rule controls both a global counting inequality and the structure of extremal examples.[ref]
Pál Turán Created 2026-10-14 Updated 2026-11-05
Pál Turán worked in number theory and combinatorics. His1934 proof of the typical size of the number of prime divisors became an important precursor of probabilistic number theory: averaging a counting function can reveal the behaviour of almost all integers without computing it separately for each integer.[ref] In extremal graph theory, the theorem carrying his name asks how many edges force a complete subgraph. The triangle case gives the sharp threshold, attained by a balanced complete bipartite graph.
Figure 1.
Portrait of Pál Turán
. Bundesarchiv, Bild 183-33149-0001 / CC-BY-SA 3.0; photographer unknown. CC BY-SA 3.0, via Wikimedia Commons. Source.
A uniformly shuffled deck makes all unordered five-card hands equally likely, giving possible hands. Choose the rank appearing four times in ways; all four suits of that rank are then fixed. The remaining card can be any of the other cards. No hand is counted twice, because five cards cannot contain two different complete four-card ranks. This use of combinatorics gives the probability
Here is a binomial coefficient; the probability also simplifies to .
Paul Erdős 2026-11-05
Paul Erdős worked on number theory, combinatorics and extremal problems. His joint 1948 paper with Nicolaas Govert de Bruijn gives an incidence bound from a unique-line-through-two-points condition.[ref]
For a finite nontrivial incidence system, the number of lines is at least the number of points. Equality forces a near-pencil or a finite projective plane. The theorem illustrates an extremal approach: determine a sharp numerical bound, then understand the configurations attaining it.[ref]
Peter G. Doyle Created 2026-10-14 Updated 2026-11-05
Peter G. Doyle is a mathematician whose work connects geometry, combinatorics and probability theory. His book with J. Laurie Snell explains how a random walk on a graph can be studied through an electrical network: a probability of reaching one boundary before another satisfies the same averaging equations as an electrical potential.[ref] His work on isospectral manifolds also investigates how much geometry can be recovered from the spectrum of a differential operator: equal vibration frequencies need not determine the shape.[ref]
q-series Created 2026-10-20 Updated 2026-11-05
A q-series is a series in a parameter , treated either as a formal power series or as an analytic series, often for . Its coefficients can encode a sequence, while identities involving infinite products record choices of parts in integer partitions.
For example,
where counts integer partitions of . Expanding each factor as a geometric series chooses the number of parts of size . Formally, each coefficient uses only finitely many factors. This product is a basic link between combinatorics, number theory, and modular forms.
Ramsey theory Created 2026-09-24 Updated 2026-10-13
Ramsey theory studies configurations that every finite coloring of a sufficiently large structure must contain. Its striking message is that some order is unavoidable even when no organized construction was used. A basic example is the Ramsey number for triangles: color every edge of a complete graph on six vertices red or blue, in any way, and some triangle in a graph has all three edges the same color. Five vertices do not suffice.
The objects receiving colors matter. In the Ramsey number for triangles, colors belong to edges, which represent all unordered pairs of distinct vertices; the vertices themselves have no colors. In the finite Ramsey theorem, colors can instead belong to all -element subsets of a finite set. A monochromatic set or homogeneous set for a colouring expresses agreement among the appropriate colored objects.
Why is this useful? Ramsey theory provides existence guarantees in combinatorics that survive every possible assignment of a fixed finite number of colors. The Ramsey theorem turns this into a structural dichotomy: every sufficiently large graph contains a large clique or a large independent set. In arithmetic, the Van der Waerden theorem guarantees monochromatic arithmetic progressions. The beauty is the universal quantifier: an adversary can choose every color and still cannot prevent the promised configuration.
These guarantees concern precisely specified configurations under stated hypotheses. They do not justify selecting arbitrary patterns in empirical data after seeing the data, or attributing statistical significance to a selected pattern. A mathematical guarantee of some monochromatic configuration alone says nothing about the empirical meaning of that configuration.
The subject's name comes from F. P. Ramsey's [ref]. The [ref] records receipt on 28 November 1928 and presentation on 13 December 1928. Ramsey introduced the Ramsey theorem for r-sets and finite Ramsey theorem as tools for a problem in mathematical logic, while recognizing their independent interest in combinatorics. He also distinguished proving that a finite threshold exists from finding its smallest value, the quantitative question captured by a Ramsey number.
Will Sawin 2026-11-05
Will Sawin works on problems connecting arithmetic and combinatorics. His paper on the union-closed sets conjecture applies entropy inequalities to a finite family closed under unions.[ref]
For a nontrivial such family, the paper guarantees an element in at least a fraction of the sets. The argument studies the union of independent random members and bounds the resulting entropy growth. It is a quantitative advance toward the conjectured one-half fraction, with the nonempty-union condition needed to exclude the family containing only the empty set.[ref]