Metraipolis › archive › dc_7cb1098b9913

Collision Positivity for Three-Variable Symmetric Monomial Inequalities — arXiv:2609.22465

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22465
License (as archived)
CC0-1.0
Archived
2026-10-09T21:44:37.159Z
SHA-256 of the archived text
7c806ffa3caac0eaa17d9de4270b519cde0b7ea54569bccc322cb5af5bd00517
Stable URL of this page
https://metraipolis.com/documento/dc_7cb1098b9913

How to cite

Collision Positivity for Three-Variable Symmetric Monomial Inequalities — arXiv:2609.22465 — arXiv (en), https://arxiv.org/abs/2609.22465 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7cb1098b9913 (Metraipolis archive dc_7cb1098b9913, sha256 7c806ffa3caac0eaa17d9de4270b519cde0b7ea54569bccc322cb5af5bd00517)
BibTeX
@misc{dc7cb1098b9913,
  title = {Collision Positivity for Three-Variable Symmetric Monomial Inequalities — arXiv:2609.22465},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22465},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7cb1098b9913; sha256 7c806ffa3caac0eaa17d9de4270b519cde0b7ea54569bccc322cb5af5bd00517},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22465. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let \(\lambda\succ\gamma\succ\mu\) be equal-degree exponent partitions with at most three parts, and let \begin{equation*} P_{\lambda,\gamma,\mu} = J_\lambda+J_\mu-2J_\gamma, \end{equation*} where \(J_\nu\) denotes the symmetric monomial orbit sum associated with \(\nu\). We prove a necessary and sufficient collision criterion for the positivity of this three-point majorization difference in three variables. For nonnegative integer exponent partitions, \begin{equation*} P_{\lambda,\gamma,\mu}(x,y,z)\ge0 \qquad(x,y,z>0) \end{equation*} if and only if \begin{equation*} P_{\lambda,\gamma,\mu}(t,1,1)\ge0 \qquad(t>0). \end{equation*} Thus the positivity of a genuinely three-variable symmetric polynomial of this form is completely determined by its one-variable restriction to the locus where two variables coincide. The theorem gives a uniform and effectively checkable criterion for an infinite class of symmetric polynomial inequalities. For a fixed integer chain, the global three-variable problem is reduced to a single univariate polynomial inequality, which can often be verified exactly by factorization, Sturm's theorem, or other one-variable methods. The criterion extends well beyond the classical Schur family, produces explicit inequalities outside the Schur pattern, and yields genuine strengthenings and refinements of Schur's inequality.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Classical Analysis and ODEs (math.CA).
Pagina del lavoro: https://arxiv.org/abs/2609.22465 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:26:41.092Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).