#### Filter Results:

#### Publication Year

2014

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Merge trees represent the topology of scalar functions. To assess the topo-logical similarity of functions, one can compare their merge trees. To do so, one needs a notion of a distance between merge trees, which we define. We provide examples of using our merge tree distance and compare this new measure to other ways used to characterize topological… (More)

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 λ-Stirling numbers.

- ‹
- 1
- ›