Searcharxiv⌕ Search

arXiv · 2609.30309

Collision Positivity for Symmetric Orbit-Sum Inequalities in Arbitrary Dimension: A Complete Two-Variable Criterion

Abstract

Let $λ\succγ\succμ$ be equal-degree nonnegative integer exponent vectors with at most $n$ parts, let $J_η^{(n)}$ be the labeled symmetric orbit sum associated with $η$, and set \begin{equation*} P_n=J_λ^{(n)}+J_μ^{(n)}-2J_γ^{(n)}. \end{equation*} For every $n\ge4$, we prove that global nonnegativity of $P_n$ on the positive orthant is equivalent to nonnegativity on the fixed two-variable section \begin{equation*} (x,y,1,\ldots,1),\qquad x,y>0. \end{equation*} Thus the positivity of this family is determined by a fixed two-dimensional section, independently of both degree and ambient dimension. In the injective hierarchy $C_k$ introduced below, the hypothesis is $C_2\ge0$, global positivity is equivalent to $C_{n-1}\ge0$, and the main step is the stable order-raising implication \begin{equation*} C_k\ge0\Longrightarrow C_{k+1}\ge0, \qquad 2\le k\le n-2. \end{equation*} For $n\ge5$, this rank-two hypothesis is strictly weaker than positivity on the normalized full collision wall, which corresponds to $C_{n-2}\ge0$. The result complements the preceding three-variable theorem \emph{Collision Positivity for Three-Variable Symmetric Monomial Inequalities: A Complete Boundary Criterion}, which proves the exceptional rank-one step $C_1\Rightarrow C_2$. The proof here is logically independent: the local three-label ingredients needed in higher rank are established directly. The main tools are a Green second-compound reserve, fixed-union exchange on adjacent subset ranks, a rank-three zero/one/two-mark contraction, and terminal boundary recombination. The theorem extends to nonnegative rational exponents by clearing denominators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Sun. 2026-09-23. Collision Positivity for Symmetric Orbit-Sum Inequalities in Arbitrary Dimension: A Complete Two-Variable Criterion. https://arxiv.org/abs/2609.30309

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

KEEP EXPLORING

Related papers

Connected Dominating Sets in Triangulations

A dominating set of a graph $G$ is \emph{connected} if it induces a connected graph in $G$. For planar triangulations, it has been known since 1990 that every $n$-vertex triangulation with $n\ge4$ admits a connected dominating set of size at most $n/2 - 1$, and no improvement to this bound was known for over three decades. We break this longstanding barrier by showing that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every triangulation admits a spanning tree with at least $11n/21$ leaves. This result has graph drawing applications, establishing a bound for one-bend free sets and improving the known bound for simultaneous planar embeddings. The connected dominating set results extend readily to show that an $n$-vertex triangulation of a surface of Euler genus $g$ has a connected dominating set of size at most $10n/21+O(\sqrt{gn})$.

math.CO↗

Curves on the torus with few intersections

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$. We determine the maximum size of such a set for every k. In particular, the maximum never exceeds k+6, and it does not exceed k+4 when k is large. As this quantity coincides with the maximal number of columns of a generic k-modular matrix with two rows, our result also settles the column number problem, a problem of interest in combinatorial optimization, for such matrices.

math.CO↗

Spectral extrema on closed surfaces of fixed Euler genus

We investigate a classical extremal problem in combinatorics and topological graph theory: determining the maximum spectral radius $spex(n,γ)$ of all $n$-vertex graphs embeddable on a closed surface of Euler genus $γ$. Building on seminal contributions by Boots and Royle, Cao and Vince, and Hong in the 1990s; Ellingham and Zha in 2000; Dvořák and Mohar in 2010; Tait and Tobin in 2017; and Liu, Ning, and Wang in 2026, we provide a complete characterization of spectral extremal graphs for any fixed Euler genus $γ$ and all sufficiently large $n$. The extremal graph attaining $\operatorname{spex}(n,γ)$ is unique, necessarily edge-extremal, and, roughly speaking, is constructed from the join $K_2 \nabla P_{n-2}$ by adding exactly $3γ$ edges. As a consequence, we derive asymptotically tight estimates for $\operatorname{spex}(n,γ)$, strengthening a classical bound due to Ellingham and Zha [J. Combin. Theory B, 2000]. We further characterize the extremal structures for the projective plane and torus, sharpening earlier bounds of Hong [J. Combin. Theory B, 1995]. For the planar case, we establish an explicit vertex threshold of $4.5\times 10^6$ for the Tait--Tobin theorem. Our approach combines extremal constructions of cellular embeddings, topological edge-switching techniques, and walk-counting estimates for large-scale substructures, revealing a bridge between spectral extremality and surface topology.

math.CO↗