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

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Added journal reference

Scientific paper

We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear Diophantine problem of Frobenius: given relatively prime positive integers $a_1,...,a_n$, find the largest value of t (the Frobenius number) such that $m_1 a_1 + ... + m_n a_n = t$ has no solution in positive integers $m_1,...,m_n$. This is equivalent to the problem of finding the largest dilate tP such that the facet $\sum_{k=1}^n x_k a_k = 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Frobenius problem, rational polytopes, and Fourier-Dedekind Sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Frobenius problem, rational polytopes, and Fourier-Dedekind Sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Frobenius problem, rational polytopes, and Fourier-Dedekind Sums will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-316727

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.