Generating functions for purely crossing partitions

MaRDI QIDQ4594200zbMATH OpenFDO

Authors Ken Dykema

Publication date 17 November 2017

Full work available at URL https://arxiv.org/abs/1602.03469, http://ajc.maths.uq.edu.au/pdf/66/ajc_v66_p276.pdf

zbMATH Keywords

generating function for Bell numbersrandom Vandermonde matrices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73)

Abstract: The generating function for the number of purely crossing partitions of {1,...,n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde matrices are derived.

Recommendations

• Partitions with \(k\) crossings
• scientific article; zbMATH DE number 5730477
• Some set partition statistics in non-crossing partitions and generating functions
• Some properties of crossings and partitions
• Bell numbers, their relatives, and algebraic differential equations

Cited in

(3)

• Generating function for \(K\)-restricted jagged partitions
• Asymptotic \(\ast\)-moments of some random Vandermonde matrices
• scientific article; zbMATH DE number 5730477 (Why is no real title available?)

This page was built for publication: Generating functions for purely crossing partitions

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