Stanley's reciprocity theorem
Gives a functional equation satisfied by the generating function of any rational cone
From Wikipedia, the free encyclopedia
Stanley's reciprocity theorem, named after the mathematician Richard P. Stanley, states that a certain functional equation is satisfied by the integer-point generating function of a rational cone and the generating function of the cone's interior.
Definitions
A rational cone is a subset of consisting of all points satisfying a finite set of homogeneous linear inequalities with integer coefficients or, alternatively, the nonnegative span of a finite set of integer vectors. That is, a rational cone C has the two alternative descriptions
for some integer matrix A (i.e., C is defined by the m halfspaces given by the rows of A), and
for some integer matrix B (i.e., C is defined as the nonnegative span of the n columns of B).
The integer-point generating function (also called integer-point transform) of such a cone C is
The generating function of the interior of the cone is defined analogously. It can be shown that these generating functions evaluate to rational functions.
The Reciprocity Theorem
Stanley's reciprocity theorem states that for a -dimensional rational cone , we have the following identity of rational functions:[1]
Stanley's reciprocity theorem generalizes Ehrhart-Macdonald reciprocity for Ehrhart polynomials of rational convex polytopes. Both of these results are examples of combinatorial reciprocity theorems,[2] a term that was, in fact, also coined by Stanley.