Path decompositions of digraphs and their applications to Weyl algebra
DOI10.1016/j.aam.2015.03.005zbMath1314.05083arXiv1408.6764OpenAlexW1995588584MaRDI QIDQ2346478
A. S. Dzhumadil'daev, Damir Yeliussizov
Publication date: 2 June 2015
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.6764
Partitions of sets (05A18) Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) (T)-ideals, identities, varieties of associative rings and algebras (16R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(2p\)-commutator on differential operators of order \(p\).
- On a new family of generalized Stirling and Bell numbers
- Combinatorial models of creation-annihilation
- Modified approach to generalized Stirling numbers via differential operators
- Eulerian polynomial identities on matrix rings
- The boson normal ordering problem and generalized Bell numbers
- \(N\)-commutators
- Minimal identities for right-symmetric algebras
- Rook numbers and the normal ordering problem
- 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
- An Application of Graph Theory to Algebra
- Minimal Identities for Algebras
This page was built for publication: Path decompositions of digraphs and their applications to Weyl algebra