arXiv (All)
open access
Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data
For general fields the footprint bound from Gröbner basis theory estimates the number of common affine roots of any set of multivariate polynomials using information on their leading monomials. In this paper we develop an interpolation bound with a similar flavor extending a previously known result
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
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences#288097
- Improved Bounds for Cross-Sperner Systems#628828
- Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization#1034358
- Comments on the recent improvements of the MRRW bounds#822282
- Fast Spectral Signing for Vector Balancing#1078115
Record · ID 1052072
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