Cyclic and linear graph partitions and normal ordering

MaRDI QIDQ5026944zbMATH OpenFDO

Authors K. J. M. Gonzales

Publication date 8 February 2022

Full work available at URL https://arxiv.org/abs/2106.08069, https://cs.uwaterloo.ca/journals/JIS/VOL25/Gonzales/gonzales2.html

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

Lah numbernormal orderingrook placementStirling numberWeyl algebra

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Bell and Stirling numbers (11B73)

Abstract: The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the alphabet $x,D$ subject to the relation $Dx=xD+1$ are equal to the Stirling number of certain graphs constructed from $w$. In this paper, we introduce graphical versions of the Stirling numbers of the first kind and the Lah numbers and show how they occur as coefficients in other normal ordering settings. Identities involving their $q$-analogues are also obtained.

Recommendations

• On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
• Walks, partitions, and normal ordering
• Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
• Normal ordering and generalised Stirling numbers
• Combinatorially interpreting generalized Stirling numbers

Cites work

• A new combinatorial interpretation of a \(q\)-analogue of the Lah numbers
• Combinatorially interpreting generalized Stirling numbers
• On a new family of generalized Stirling and Bell numbers
• Rook numbers and the normal ordering problem
• Rook theory. III: Rook polynomials and the chromatic structure of graphs
• Stirling numbers of the first kind for graphs
• Two approaches to normal order coefficients

Cited in

(10)

• Normal ordering problem and the extensions of the Stirling grammar
• Commutation relations, normal ordering, and Stirling numbers
• Two approaches to normal order coefficients
• On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
• Stirling numbers of the first kind for graphs
• Normal ordering associated with -Whitney numbers of the first kind in -shift algebra
• Normal ordering associated with \(\lambda\)-Stirling numbers in \(\lambda\)-shift algebra
• Labeled graph rearrangements on matched and star products
• Combinatorial optimization of special graphs for nodal ordering and graph partitioning
• Walks, partitions, and normal ordering

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Cyclic and linear graph partitions and normal ordering

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