Walks, partitions, and normal ordering

zbMath1323.05015MaRDI QIDQ888618

A. S. Dzhumadil'daev, Damir Yeliussizov

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p10

zbMATH Keywords

Stirling numbersWeyl algebradifferential operatorsset partitionswalks

Mathematics Subject Classification ID

Partitions of sets (05A18) Bell and Stirling numbers (11B73) (q)-calculus and related topics (05A30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Recent developments in combinatorial aspects of normal ordering

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple combinatorial interpretation of certain generalized Bell and Stirling numbers
• On a new family of generalized Stirling and Bell numbers
• Combinatorial models of creation-annihilation
• The \(r\)-Stirling numbers
• Modified approach to generalized Stirling numbers via differential operators
• The complementary symmetric functions: Connection constants using negative sets
• The boson normal ordering problem and generalized Bell numbers
• Reduction of \(m\)-regular noncrossing partitions
• Path decompositions and Gallai's conjecture
• Path decompositions of digraphs and their applications to Weyl algebra
• A combinatorial interpretation of the connection constants for persistent sequences of polynomials
• Rook numbers and the normal ordering problem
• Commutation Relations, Normal Ordering, and Stirling Numbers
• Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
• Normal ordering for deformed boson operators and operator-valued deformed Stirling numbers
• Path-Partition Structures of Graphs and Digraphs
• An upper bound for the path number of a graph
• The (r1,...,rp)-Stirling Numbers of the Second Kind
• Packing Digraphs with Directed Closed Trails
• Path decompositions of digraphs
• Gallai's Conjecture For Graphs of Girth at Least Four

This page was built for publication: Walks, partitions, and normal ordering