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 5
An example of a non-sofic hyperbolic group
We construct a torsion-free, two-dimensional, word-hyperbolic group which is not sofic.Near optimal gap in the Lonely Runner Conjecture
For a set $V$ of $n$ distinct positive integers, let $\mathrm{ML}(V)=\max_{t\in\mathbb{R}/\mathbb{Z}}\min_{v\in V}\|vt\|$, where $\|x\|$ is the distance from $x$ to the nearest integer.The maximum number of Hamiltonian cycles in tournaments
Let $C(n)$ denote the maximum number of directed Hamiltonian cycles in a tournament on $n$ vertices.New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds
We give explicit binary constant-weight codes that raise the lower bounds on $A(n,6,w)$ in eight cells of Brouwer's table, all now listed there.Strong $\mathfrak{sl}_2$ Actions and Symmetric Chain Decompositions
We introduce a notion of a strong $\mathfrak{sl}_2$-action on a poset, and conjecture the existence of such an action is equivalent to the existence of a symmetric chain decomposition of that poset.A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks.Connectivity Bounds for GHZ Graphs
Greenberger-Horne-Zeilinger (GHZ) states are multipartite entangled quantum states that play a central role in quantum information theory, with applications in quantum communication, cryptography…Geometric Graph Representations via Compact SAT Encodings
We present compact SAT encodings and certifying exact solvers for boxicity and cubicity.Quantized six-vertex realizations of frustration graphs
A recent graph-theoretic criterion for a Hamiltonian to exhibit a free-parafermion spectrum is that its frustration graph be an indifference graph.Degeneracy graph determinants and higher-dimensional Young diagrams
Kemp and Ramgoolam proposed a basis of monomials for a commutative semisimple algebra with generators \(C_1,\ldots, C_L\), constructed from a degeneracy graph which records how the eigenspaces of \(…Claw-Free and Line Graph Edge Deletion on Block Graphs
Edge deletion problems ask for the fewest edges whose deletion gives a graph with a specified property.A polylogarithmic bound for list replicability
Zhang [Zha26] recently posted a manuscript announcing that the list-replicability number of every class of $M\ge 2$ binary concepts on $N\ge 2$ domain points is $O(\log^2 M\log N)$, which would be…Eccentricity Shortest Path: the structural parameter landscape
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer $R$, whether some shortest path is within distance $R$ of every vertex.The Lovász number is not alone: a continuum of Rényi points in the entanglement-assisted spectrum of graphs
Li and Zuiddam's entanglement-assisted asymptotic spectrum of graphs consists of the normalized graph parameters that are additive under disjoint unions, multiplicative under strong products and…Perfect and peak state transfer on IBM quantum hardware
We run continuous-time quantum walks with perfect and peak state transfer on a present-day superconducting quantum processor, IBM Quantum's $156$-qubit Heron device ibm_kingston, deliberately…On the Hardy--Littlewood--Chowla conjecture
An old conjecture dating back at least to Hildebrand's work in 1989, asserts that the Möbius function exhibits cancellation on shifted primes; that is, $$\sum_{p\le x}μ(p+2)=o(π(x)),\quad \text{or…On the Lattice Tilings by Lee Balls: Q-Polynomials, Group-Ring Equations, and a Decision Algorithm
More than 50 years ago, Golomb and Welch conjectured that no tilings of $\mathbb{Z}^n$ by Lee balls of radius $r$ exist for $n \geq 3$ and $r \geq 2$.Connectivity keeping pendant extensions of paths in $k$-connected triangle-free graphs
Motivated by Mader's conjecture on connectivity keeping trees, we study the corresponding problem in triangle-free graphs.A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles
We completely characterize the solvability profiles of tasks for two autonomous mobile robots in the plane under variable disorientation, chirality, and rigid movements.A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in $(0,1)$.