activity
20012005
most citedEhrhart-Macdonald reciprocity extended

10 citations · 24 across the 11 of their papers we have counts for

collaborators
Showing math.COShow all

12 papers · 1 filter

math.CO200510 cited

Ehrhart-Macdonald reciprocity extended

Matthias Beck, Richard Ehrenborg

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an inti…

math.CO20042 cited

On Stanley's reciprocity theorem for rational cones

Matthias Beck, Mike Develin

We give a short, self-contained proof of Stanley's reciprocity theorem for a rational cone K \subset R^d. Namely, let sigma_K (x) = sum_{m \in K \cap Z^d} x^m. Then sigma_K (x) and…

math.CO2003

The partial-fractions method for counting solutions to integral linear systems

Matthias Beck

We present a new tool to compute the number $ϕ_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are inte…

math.CO20031 cited

The polynomial part of a restricted partition function related to the Frobenius problem

Matthias Beck, Ira M. Gessel, Takao Komatsu

Given a set of positive integers A = {a_1,...,a_n}, we study the number p_A (t) of nonnegative integer solutions (m_1,...,m_n) to m_1 a_1 + ... m_n a_n = t. We derive an explicit f…

math.CO20038 cited

Counting Lattice Points by means of the Residue Theorem

Matthias Beck

We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis an…

math.CO2003

A Closer Look at Lattice Points in Rational Simplices

Matthias Beck

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we u…