Papers › Ehrhart theory on periodic graphs II: Stratified Ehrhart ring theory
Ehrhart theory on periodic graphs II: Stratified Ehrhart ring theory
Takuya Inoue, Yusuke Nakamura
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.
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence (s_(Γ, x₀, i))_(i ≥0) is defined for a graph Γ and its fixed vertex x₀, where s_(Γ, x₀, i) is defined as the number of vertices of Γ at distance i from x₀. Although the sequences (s_(Γ, x₀, i))_(i ≥0) for periodic graphs are known to be of quasi-polynomial type, their determination had not been established, even in dimension two. Our theory and algorithm can be applied to arbitrary periodic graphs of any dimension. As an application of the algorithm, we determine the growth sequences in several new examples.
Code
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