Walks, Partitions, and Normal Ordering
Copyright policy )Walks, Partitions, and Normal Ordering
We describe the relation between graph decompositions into walks and the normal ordering of differential operators in the $n$-th Weyl algebra. Under several specifications, we study new types of restricted set partitions, and a generalization of Stirling numbers, which we call the $\lambda$-Stirling numbers.
- Kazakh-British Technical University Kazakhstan
set partitions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Partitions of sets, \(q\)-calculus and related topics, differential operators, Bell and Stirling numbers, walks, Weyl algebra, Stirling numbers
set partitions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Partitions of sets, \(q\)-calculus and related topics, differential operators, Bell and Stirling numbers, walks, Weyl algebra, Stirling numbers
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!