Normal ordering problem and the extensions of the Stirling grammar

DOI10.1134/S1061920814020095zbMATH Open1311.81189arXiv1308.0169OpenAlexW3098776780MaRDI QIDQ2344155FDOQ2344155

Authors: Shi-Mei Ma, Toufik Mansour, Matthias Schork 

Publication date: 12 May 2015

Published in: Russian Journal of Mathematical Physics (Search for Journal in Brave)

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 $r$-Dowling polynomials. Also, possible avenues for future research are described.

Full work available at URL: https://arxiv.org/abs/1308.0169

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

Mathematics Subject Classification ID

Perturbative methods of renormalization applied to problems in quantum field theory (81T15)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• The boson normal ordering problem and generalized Bell numbers
• Title not available (Why is that?)
• On some numbers related to Whitney numbers of Dowling lattices
• Enumeration of permutations by number of alternating runs
• \(r\)-Whitney numbers of Dowling lattices
• A new formula for the Bernoulli polynomials
• The \(r\)-Stirling numbers
• Some remarks about the derivation operator and generalized Stirling numbers.
• Rook numbers and the normal ordering problem
• William Chen grammars and derivations in trees and arborescences
• Context-free grammars for permutations and increasing trees
• Context-free grammars, differential operators and formal power series
• On a new family of generalized Stirling and Bell numbers
• Representing elements of the Weyl algebra by labeled trees
• The commutation relation \(xy=qyx+hf(y)\) and Newton's binomial formula
• A family of two-variable derivative polynomials for tangent and secant
• Some combinatorial arrays generated by context-free grammars
• Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
• Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
• Combinatorial models of creation-annihilation
• Modified approach to generalized Stirling numbers via differential operators
• Combinatorial interpretation of generalized Stirling numbers
• On the combinatorics of normal ordering bosonic operators and deformations of it
• Normal ordering for deformed boson operators and operator-valued deformed Stirling numbers
• Normal ordering \(q\)-bosons and combinatorics
• Deformed bosons: combinatorics of normal ordering
• A generalization of boson normal ordering
• Title not available (Why is that?)
• General ordering problem and its combinatorial roots
• Normal ordering and generalised Stirling numbers

Cited In (5)

• Title not available (Why is that?)
• Combinatorially interpreting generalized Stirling numbers
• The formal derivative operator and multifactorial numbers
• Some combinatorial arrays related to the Lotka-Volterra system
• On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks

Uses Software

• OEIS

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)