Applied Math · Mathematics & Statistics
Combinatorics
The newest papers in Combinatorics that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
228 papers, from 31 August 2026 to 5 November 2026: 168 arXiv preprints and 60 OpenAlex records.
Get the few papers worth your time in Combinatorics every morning.
Follow Combinatorics and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 7
The chromatic number of the associahedron: simple and logarithmic
Addario-Berry, Reed, Scott, and Wood (JoCG 2026) proved that the $n$-dimensional associahedron has chromatic number at most $22500\cdot\log_3 n+O(1)$.Mutually unbiased bases: common states, completion, and extension obstructions
Which pure states give uniform outcomes in several mutually unbiased measurements, and when can they form another measurement basis?Subspace Uncertainty and Sharp Sampling Thresholds on the Boolean Cube
We study Gaussian regression under squared population $L_2$ loss in a known $m$-dimensional subspace of degree-at-most-$k$ functions on the $d$-dimensional Boolean cube.Toward Maximizing Algebraic Connectivity via Density-Dependent Backbone Construction and Reinforcement Learning Completion
This paper studies an open network design problem of constructing graph topologies with maximum algebraic connectivity under fixed numbers of vertices and edges.Measurable obstructions for unmeasurable colourings
Due to the availability of powerful analytic techniques, vastly superior lower bounds are known for the measurable chromatic number of Euclidean spaces compared to their ordinary chromatic number.A deterministic algorithm for signing bipartite graphs at the Ramanujan bound
We give a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.Moment Methods for Uniform Average Mixing on Strongly Regular Graphs
We study continuous-time quantum walks on connected strongly regular graphs that are not complete, observed at a random time drawn from a freely chosen probability law.Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
String attractors provide a compact way of representing the complete factor structure of a word: a set of positions is an attractor if every distinct factor has at least one occurrence crossing one…Perfect state transfer on mixed graphs: complete classes and transfer times
For perfect state transfer (PST) on unweighted mixed graphs, we classify the normalized transfer times of complete PST classes.On the complexity of the single-move labeled token routing problem
In neutral-atom quantum computers, atoms are moved to target positions along paths of empty positions, and a target position may be reserved for one species of atom.Stability of plethysm coefficients and modified polynomial induction
Let $h_n$ denote the complete homogeneous symmetric function of degree $n$, $s_ν$ the Schur function indexed by a partition $ν$, and $\langle\cdot,\cdot\rangle$ the Hall inner product.Inheritance of expansion and oriented Hamilton cycles in robust expanders: a regularity-free proof
Häggkvist and Thomason proved that every $n$-vertex oriented graph with minimum semidegree at least $(\frac{5}{12}+o(1))n$ contains every orientation of a Hamilton cycle.Character expansions and affine Jacobi-Trudi identities
We provide character expansions of certain specialisations of multiparameter Hall--Littlewood polynomials of types $\mathrm{B}_n$, $\mathrm{C}_n$, and $\mathrm{BC}_n$ for rectangular shapes.Optimal bound for the polynomial Littlewood-Offord problem
We present an exposition of an argument, discovered by GPT-6 Pro, that gives an optimal bound for the polynomial Littlewood-Offord problem.Non-dyadic Laver algebras
We study finite Laver algebras, the generalizations of Laver tables on sets of cardinality not of the form $2^n$.Posh Parking Spaces
Let $W$ be an irreducible complex reflection group with reflection representation $V$.Quantum codes in the Lee metric
We introduce a quantum coding framework for discrete small-shift noise, in which errors on qudits are modeled as low-weight $X$- and $Z$-type Pauli shifts, analogous to small phase-space…Quantum n-coloring is undecidable for every n $\ge$ 3
The quantum $n$-coloring problem, given graph $G$, asks whether there exists a perfect quantum strategy for the $n$-coloring game of $G$.The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence
The Firefighter Problem models a spreading process (originally a fire, alternatively an infection or rumour, for example) on a graph.Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census
Every balanced instance of the stable marriage problem with strict complete preferences has a unique finest partition into prime blocks, and that single partition simultaneously factors three…