The Frobenius problem, rational polytopes, and Fourier-Dedekind sums

From MaRDI portal
Publication:1864844

DOI10.1006/JNTH.2002.2786zbMATH Open1038.11026arXivmath/0204035OpenAlexW1971718614MaRDI QIDQ1864844FDOQ1864844


Authors: Matthias Beck, Sinai Robins, Ricardo L. Diaz Edit this on Wikidata


Publication date: 23 March 2003

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: We study the number of lattice points in integer dilates of the rational polytope P=(x1,...,xn)inRgeq0n:sumk=1nxkakleq1, where a1,...,an are positive integers. This polytope is closely related to the linear Diophantine problem of Frobenius: given relatively prime positive integers a1,...,an, find the largest value of t (the Frobenius number) such that m1a1+...+mnan=t has no solution in positive integers m1,...,mn. This is equivalent to the problem of finding the largest dilate tP such that the facet sumk=1nxkak=t contains no lattice point. We present two methods for computing the Ehrhart quasipolynomials of P which count the integer points in the dilated polytope and its interior. Within the computations a Dedekind-like finite Fourier sum appears. We obtain a reciprocity law for these sums, generalizing a theorem of Gessel. As a corollary of our formulas, we rederive the reciprocity law for Zagier's higher-dimensional Dedekind sums. Finally, we find bounds for the Fourier-Dedekind sums and use them to give new bounds for the Frobenius number.


Full work available at URL: https://arxiv.org/abs/math/0204035




Recommendations




Cites Work


Cited In (27)





This page was built for publication: The Frobenius problem, rational polytopes, and Fourier-Dedekind sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864844)