Normal ordering problem and the extensions of the Stirling grammar
From MaRDI portal
Publication:2344155
Abstract: The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well known combinatorial sequences, including the generalized Stirling numbers of the second kind related to the normal ordering problem and the -Dowling polynomials. Also, possible avenues for future research are described.
Recommendations
- On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
- Normal ordering and generalised Stirling numbers
- Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
- Cyclic and linear graph partitions and normal ordering
- Combinatorial interpretation of generalized Stirling numbers
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 473058 (Why is no real title available?)
- A family of two-variable derivative polynomials for tangent and secant
- A generalization of boson normal ordering
- A new formula for the Bernoulli polynomials
- Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
- Combinatorial interpretation of generalized Stirling numbers
- Combinatorial models of creation-annihilation
- Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
- Context-free grammars for permutations and increasing trees
- Context-free grammars, differential operators and formal power series
- Deformed bosons: combinatorics of normal ordering
- Enumeration of permutations by number of alternating runs
- General ordering problem and its combinatorial roots
- Modified approach to generalized Stirling numbers via differential operators
- Normal ordering \(q\)-bosons and combinatorics
- Normal ordering and generalised Stirling numbers
- Normal ordering for deformed boson operators and operator-valued deformed Stirling numbers
- On a new family of generalized Stirling and Bell numbers
- On some numbers related to Whitney numbers of Dowling lattices
- On the combinatorics of normal ordering bosonic operators and deformations of it
- Representing elements of the Weyl algebra by labeled trees
- Rook numbers and the normal ordering problem
- Some combinatorial arrays generated by context-free grammars
- Some remarks about the derivation operator and generalized Stirling numbers.
- The On-Line Encyclopedia of Integer Sequences
- The \(r\)-Stirling numbers
- The boson normal ordering problem and generalized Bell numbers
- The commutation relation \(xy=qyx+hf(y)\) and Newton's binomial formula
- William Chen grammars and derivations in trees and arborescences
- \(r\)-Whitney numbers of Dowling lattices
Cited in
(5)- Combinatorially interpreting generalized Stirling numbers
- scientific article; zbMATH DE number 7644296 (Why is no real title available?)
- Some combinatorial arrays related to the Lotka-Volterra system
- The formal derivative operator and multifactorial numbers
- On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
This page was built for publication: Normal ordering problem and the extensions of the Stirling grammar
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344155)
