arXiv (All)
open access
Polynomial-Time Lattice-Point Counting without Barvinok Decomposition
By using constant term manipulations, we present the first polynomial-time algorithm for lattice-point counting in fixed dimension that does not rely on Barvinok's unimodular decomposition. Our method starts from partial fraction decompositions and root-of-unity formulas for the lattice-point genera
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
- Rationality and Quasipolynomiality of Restricted Rectangle Partitions#1071108
- Four-square polynomial triples: quadratic classification and equal-degree obstructions#1201578
- New Hoffman-type generators for alternating multiple zeta values#1248801
- On the polynomial values represented by binary quadratic forms#1011156
- Recursive-Line Zarankiewicz Numbers with Four Columns#1083231
Record · ID 1232823
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