Walks, Partitions, and Normal Ordering

The Electronic Journal of Combinatorics, 2015

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.37236/5181
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.