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 12
Odd denominators in the Lonely Runner spectrum for six speeds
For distinct positive integers v_1, ..., v_n let ML(v_1, ..., v_n) be the largest number L such that at some time t every t vi is at distance at least L from the nearest integer; the Lonely Runner…A new proof that more than $2/3$ of the zeros of the Riemann zeta function are simple and on the critical line
We obtain a new, conceptually simpler, unconditional proof that more than $67.25\%$ of the non-trivial zeros of the Riemann zeta function are simple and on the critical line, and that at least…Non-attacking rook placements on crossword grids
We introduce the notion of a non-attacking rook placement on a crossword grid.The Truncated Octahedral Conjecture
Among three-dimensional parallelohedra of fixed volume, the Archimedean truncated octahedron uniquely minimizes surface area, affirming a conjecture of K. Bezdek from 2006.Points of maximal traffic on a grid with obstruction
For $n\in\mathbb{N}$, we consider the set of lattice paths from $(0,0)$ to $(n,n)$ using only unit north and east steps.Rotational Equivariance in Machine Learning: A Comprehensive Tutorial
Rotational symmetry is one of the most important structural principles in machine learning on 3D data.Strengthening Recursive Constructions for Zero-Error Shannon Capacity
The exact Shannon capacity is unknown for every odd cycle beyond the five-cycle $C_5$, making odd cycles a central open problem in zero-error information theory.Localization of the Caro-Wei bound and its applications to bipartiteness
We confirm a conjecture of Brause, Randerath, Rautenbach and Schiermeyer (2016) by proving a localized lower bound on the independence number of a graph that strengthens the classical bounds of…