A short proof of the rook reciprocity theorem

MaRDI QIDQ1909977zbMATH OpenFDO

Authors Timothy Y. Chow

Publication date 21 July 1996

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/118929, http://www.emis.de/journals/EJC/Volume_3/volume3.html#R10

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complementary boardsreciprocity

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Review text

Summary: Rook numbers of complementary boards are related by a reciprocity law. A complicated formula for this law has been known for about fifty years, but recently Gessel and the present author independently obtained a much more elegant formula, as a corollary of more general reciprocity theorems. Here, following a suggestion of Goldman, we provide a direct combinatorial proof of this new formula.

Recommendations

• Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences
• Augmented rook boards and general product formulas
• On Garsia-Remmel problem of rook equivalence
• Rook Theory. II: Boards of Binomial Type

Cited in

(7)

• A direct combinatorial proof of a positivity result
• Generalized rook polynomials
• Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
• Rook numbers and the normal ordering problem
• Complexity and approximability of the cover polynomial
• The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs
• Combinatorial reciprocity for non-intersecting paths

This page was built for publication: A short proof of the rook reciprocity theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909977)