File placements, fractional matchings, and normal ordering

DOI10.1007/s00026-022-00599-yzbMath1503.05007OpenAlexW4295337151MaRDI QIDQ2093259

Matthias Schork

Publication date: 7 November 2022

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-022-00599-y

zbMATH Keywords

Weyl algebrageneralized Stirling numbersFerrers boardsrook placementsnormal orderingfile placementsshift algebra

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Associative rings and algebras arising under various constructions (16S99) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

Normal ordering in the shift algebra and the dual of Spivey’s identity

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic normality of some graph sequences
• Elliptic rook and file numbers
• Combinatorial models of creation-annihilation
• Some operational formulas
• On the R. A. Sack theorem for translation operators
• Generalized rook polynomials
• Weight-dependent commutation relations and combinatorial identities
• Enumerative properties of Ferrers graphs
• Dual filtered graphs
• Rook numbers and the normal ordering problem
• Commutation Relations, Normal Ordering, and Stirling Numbers
• On Arrays of Numbers
• Recent developments in combinatorial aspects of normal ordering
• Rook theory for perfect matchings

This page was built for publication: File placements, fractional matchings, and normal ordering