Combinatorial interpretation and proof of Glaisher-Crofton identity

Abstract

We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function methodology of modern enumerative combinatorics and their applications to computational problems.

13 pages, 4 figures

References in corpus (5)

• Combinatorics and Boson normal ordering: A gentle introduction
• Representations of Monomiality Principle with Sheffer-type Polynomials and Boson Normal Ordering
• Boson Normal Ordering via Substitutions and Sheffer-type Polynomials
• Some useful combinatorial formulae for bosonic operators
• On Urn Models, Non-commutativity and Operator Normal Forms