Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated 54 min ago
PreprintCC BY 4.0arXiv

Ideal Gårding polynomials

Abstract

We introduce ideal Gårding polynomials, a convexity-enhanced subclass of Gårding polynomials whose Gårding components are recursively convex under partial differentiation. This class strictly contains real stable polynomials and, after translation and homogenization, lies in the Lorentzian class. Our main result is that ideal Gårding polynomials still admit a robust structure theory despite this additional convexity: they are preserved under polarization, satisfy natural closure properties, and support a linear preserver theory. A key contribution of this paper is a universal model for univariate Gårding polynomials, described by monotone root sequences and equivalently by volume polynomials of Pitman--Stanley polytopes. We establish quotient concavity, and Newton--Maclaurin type inequalities, which leads to the polarization theorem, and suggests further connections with convex geometry and Lorentzian polynomials.

Related

  1. Null polynomials over a finite ring need not form a two-sided ideal
    Valentin Havlovec
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Ideal class groups of certain real quadratic number fields and factorizations of values of certain quadratic polynomials
    Stéphane R. Louboutin
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
  3. On Lattice Tilings by Symmetric Limited Magnitude Error Balls: Q-polynomials and Ideal Characterization
    Ang Xiao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Duality for Garding operators and a new inequality of GM/AM type
    F. Reese Harvey, H. Blaine Lawson Jr
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Spectral Gårding Elliptic Equations
    Hao Fang, Biao Ma
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
BibTeX
@misc{fang2026ideal,
  title = {{Ideal Gårding polynomials}},
  author = {Hao Fang and Biao Ma},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2607.16832},
  eprint = {2607.16832},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.16832},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Ideal Gårding polynomials
AU  - Hao Fang
AU  - Biao Ma
PY  - 2026
DA  - 2026/10/16
PB  - arXiv
DO  - 10.48550/arxiv.2607.16832
UR  - https://arxiv.org/abs/2607.16832
AB  - We introduce ideal Gårding polynomials, a convexity-enhanced subclass of Gårding polynomials whose Gårding components are recursively convex under partial differentiation. This class strictly contains real stable polynomials and, after translation and homogenization, lies in the Lorentzian class. Our main result is that ideal Gårding polynomials still admit a robust structure theory despite this additional convexity: they are preserved under polarization, satisfy natural closure properties, and support a linear preserver theory. A key contribution of this paper is a universal model for univariate Gårding polynomials, described by monotone root sequences and equivalently by volume polynomials of Pitman--Stanley polytopes. We establish quotient concavity, and Newton--Maclaurin type inequalities, which leads to the polarization theorem, and suggests further connections with convex geometry and Lorentzian polynomials.
ER  -