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 11
Beyond Kruskal: Polynomial-Time Tensor Decomposition under the Lovitz-Petrov Condition
Identifiability criteria certify that a given tensor decomposition is a unique rank decomposition.NOC NOC, who's there? Clustering systems of tree-child and normal networks
Clustering systems provide a natural way to encode structural information contained in phylogenetic networks.Edge-addition monotonicity of positive p-energy fails for every p >= 1
At a 2021 AIM workshop, Guo conjectured that the positive square energy s+ = E+_2 should inherit the familiar edge-addition monotonicity of the spectral radius, rho(G + uv) >= rho(G).A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying…Polyhedral Geometry of Time-to-First-Spike Neural Networks
We study the expressivity of spiking neural networks, which provide a natural framework for asynchronous, event-driven computation complementary to conventional feedforward neural networks.Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs.Identifiability of Nonnegative Tensor Decompositions via Positive Scattering
Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families.Internal congruences modulo powers of 2 for $k$-colored overpartitions into odd parts
Let $\overline{po}_k(n)$ denote the number of $k$-colored overpartitions of $n$ into odd parts.Subexponential Approximation of the Permanent in Deterministic Polynomial Time
We give the first deterministic polynomial time algorithm that approximates the permanent of arbitrary nonnegative rational matrices within a subexponential factor.Integer group determinants for abelian groups of order 24
We determine the integer group determinant sets for $C_{24}$, $C_2\times C_{12}$ and $C_2^2\times C_6$, the three abelian groups of order $24$.A $(\log n)^{1/4}$ Bound for the Komlós Problem
Let $A\in\mathbb{R}^{m\times n}$ have columns of Euclidean norm at most one.Entropy bounds and global couplings for union-closed families
We give a computer-assisted proof that every finite union-closed family containing a nonempty set has an element in at least 0.38288525 of its members.Integer group determinants for the elementary abelian group of order 49
Let $G=C_7\times C_7$, and let $S(G)$ denote the set of integer values of its group determinant.Tensor network representations of discrete maximum entropy distributions via mean polytopes
We present tensor network representations for discrete maximum entropy distributions under expectation constraints.Improved Integrality Gap for Multicommodity Flow on Trees
We improve the best known lower bound on the integrality gap for weighted unit-demand multicommodity flow on trees from $1/4$ to $2/5$, improving on the long-standing bound of Chekuri, Mydlarz, and…The Converse Problem for the Morley Tetrahedron: Counterexamples, Conjectures, and Partial Results
In a paper in Acta Mathematica Hungarica the author proved that the Morley tetrahedron of an isosceles tetrahedron, obtained by trisecting the six dihedral angles, is again isosceles, and proposed…Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes.Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates.The oriented Kesten--McKay law for random regular digraphs
We consider the adjacency matrix of a random directed $d$-regular graph on $N$ vertices.Bounded ratios for Lorentzian polynomials
We study multiplicative inequalities among the coefficients of Lorentzian polynomials through the notion of bounded ratios.