arXiv (All)
open access
Ideal Gårding polynomials
05b3526c1060c05analysis-of-pdesclassical-analysis-and-odescombinatoricsoptimization-and-controlprobability
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Correlation attacks using a new class of weak feedback polynomials#334463
- Finite Gaussian Reconstruction of Polynomial Orbits: From Correlated Moments to Oscillatory Periods#609637
- Annihilating Polynomials for Quadratic Forms#1100086
- Some new classes of permutation polynomials and their compositional inverses#684174
- Some new classes of permutation polynomials and their compositional inverses#682399
Record · ID 1387125
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive