Searcharxiv⌕ Search

arXiv · 2610.30058

Facets of the X-ray polytope of doubly stochastic matrices

Abstract

We study the polytope of anti-diagonal X-rays of k x k doubly stochastic matrices, the image of the Birkhoff polytope under the map that sums the entries along each anti-diagonal. Its facets other than the coordinate facets are the minimal joint tail bounds for lattice laws of a sum of two dependent uniform random variables. We give an exact facet criterion in terms of the allowed edges of a tight graph. For rays of the underlying tropical fan, total support of the tight graph suffices for a facet but is not necessary, as an example with k=19 shows. Up to affine functions and positive scaling, the potentials that define a facet form a polytope whose vertices are its rays. Facets propagate by padding and by grid refinement under explicit hypotheses. We give infinite families of facets from no step potential, facets of quadratic height, superpolynomially many facets, and a classification of three-step potentials. Total support of a step potential is characterized by a Hall-type condition on block starts; with computer assistance, total support decides facets of step potentials for k<=26. The facet counts up to k=12 are found directly for k<=3 and, for k>=4, come from an enumeration by a provably complete algorithm; an independent exact recomputation reproduces its ray lists for 5<=k<=12.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Prashant Chaudhary, Kapil Khandelwal. 2026-10-21. Facets of the X-ray polytope of doubly stochastic matrices. https://arxiv.org/abs/2610.30058

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Domination polynomial of co-maximal graphs of integer modulo ring

We investigate the domination polynomial of the co-maximal graph $Γ(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Such a polynomial encodes domination sets of all possible sizes, a NP-hard problem for general graph. We give exact formulas for prime powers, integers with two distinct prime divisors, and products of three distinct primes. A prime-support decomposition gives a finite explicit formula for arbitrary $n$, including repeated prime factors. Further results determine the highest coefficients, the precise threshold beyond which every vertex subset dominates, and the number of non-dominating subsets. We discuss unimodality and log-concavity, and derive justified bounds for nonzero domination roots using the Eneström--Kakeya theorem.

math.CO↗

On gcd-graphs over matrix rings

Graphs defined over finite rings are well studied in the literature. The study of these graphs benefits from rich connections between several areas of mathematics, including number theory, algebra, combinatorics, and graph theory, and these connections often lead to interesting interactions between algebraic and combinatorial structures. In this article, we investigate gcd-graphs defined over matrix rings with coefficients in finite fields. We show that these graphs exhibit several interesting graph-theoretic properties. Along the way, we also prove some results on the structure of matrix rings, which may be of independent interest.

math.CO↗

A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs

An induced matching is a matching that forms an induced subgraph. A graph is $t$-color-critical if removing some induced matching of size $t$ lowers its chromatic number, but removing any $t-1$ vertices does not. Let $F$ be a $t$-color-critical graph with $χ(F)=r+1$. For sufficiently large $n$, Simonovits determined the unique edge-extremal $F$-free graph on $n$ vertices. Recently, Zheng, Li and Li [Linear Algebra Appl.\ 730 (2026) 546--565] conjectured that, for $t\ge 2$ and $r\ge 3$, the join $K_{t-1}\vee T_{n-t+1,r}$ uniquely maximizes the signless Laplacian spectral radius among all $n$-vertex $F$-free graphs when $n$ is sufficiently large. In this paper, we prove this conjecture. In contrast to the usual spectral arguments, our proof of this conjecture relies on two techniques of a rather different flavour. Our first technique is an analogue of Zykov symmetrization for the signless Laplacian matrix. Our second technique is an induction on $n$, from which we obtain the lower bound on the smallest entry of the Perron vector of a signless Laplacian spectral extremal graph rather than a structural statement.

math.CO↗