Papers › Asymptotic behaviour of integer programming and the v-function of a graded filtration

Asymptotic behaviour of integer programming and the v-function of a graded filtration

13 Mar 2024arXiv:2403.08435links table onlyarchive 2025-07-28

Antonino Ficarra, Emanuele Sgroi

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The v-function of a graded filtration ℐ={I_([k])}_(k≥0) is introduced. Under the assumption that ℐ is Noetherian, we prove that the v-function v(I_([k])) is an eventually quasi-linear function. This result applies to several situations, including ordinary powers, and integral closures of ordinary powers, among others. As another application, we investigate the asymptotic behaviour of certain integer programming problems. Finally, we present the \textit{Macaulay2} package VNumber.

PaperPDFCode

Code

emanuelesgroi/vnumber officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections