in combinatorial mathematics, stanley's reciprocity theorem, named after mit mathematician richard p. stanley, states that a certain functional equation is satisfied by the generating function of any rational cone (defined below) and the generating function of the cone's interior. a rational cone is the set of all d-tuples :(a1, ..., a'd) of nonnegative integers satisfying a system of inequalities :m\left[\begin{matrix}a_1 \\ \vdots \\ a_d\end{matrix}\right] \geq \left[\begin{matrix}0 \\ \vdots \\ 0\end{matrix}\right] where m is a matrix of integers. a d-tuple satisfying the corresponding strict inequalities, i.e., with ">" rather than "â¥", is in the interior of the cone. the generating function of such a cone is :f(x_1,\dots,x_d)=\sum_{(a_1,\dots,a_d)\in {\rm cone}} x_1^{a_1}\cdots x_d^{a_d}. the generating function fint(x1, ..., x'd) of the interior of the cone is defined in the same way, but one sums over d-tuples in the interior rather than in the whole cone. it can be shown that these are rational functions. stanley's reciprocity theorem states that :f(1/x_1,\dots,1/x_d)=(-1)^d f_{\rm int}(x_1,\dots,x_d). matthias beck, mike develin, and sinai robins have shown how to prove this by using the calculus of residues. develin has said that this amounts to proving the result "without doing any work". ==references== * r.p. stanley, "combinatorial reciprocity theorems", advances in mathematics, volume 14 (1974), pages 194â253. ==external links== * on stanley's reciprocity theorem for rational cones, by beck, develin, and robins -- arxiv abstract
Algebraic_combinatorics Theorems_in_combinatorics