Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums
From MaRDI portal
Publication:1611058
DOI10.1007/s00454-001-0082-3zbMath1009.11058arXivmath/0111329OpenAlexW1528466706MaRDI QIDQ1611058
Publication date: 25 February 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0111329
Related Items (5)
Integral points in rational polygons: a numerical semigroup approach ⋮ Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds ⋮ Counting lattice points in certain rational polytopes and generalized Dedekind sums
This page was built for publication: Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums