“Stanley's reciprocity theorem”的意思、由来-开放百科全书

词条

Stanley's reciprocity theorem

释义

Definitions
Formulation
See also
References

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.

Definitions

A rational cone is the set of all d-tuples

(a₁, ..., a_d)

of nonnegative integers satisfying a system of inequalities

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

The generating function F_int(x₁, ..., 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.

Formulation

Stanley's reciprocity theorem states that for a rational cone as above, we have

Matthias Beck and Mike Develin 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".{{fact|date=March 2010}}

Stanley's reciprocity theorem generalizes Ehrhart-Macdonald reciprocity for Ehrhart polynomials of rational convex polytopes.

References

R.P. Stanley, "Combinatorial reciprocity theorems", Advances in Mathematics, volume 14 (1974), pages 194–253.
M. Beck, M. Develin, [https://arxiv.org/abs/math.CO/0409562 On Stanley's reciprocity theorem for rational cones], 2004

2 : Algebraic combinatorics|Theorems in combinatorics

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

Definitions

Formulation

See also

References