On Sums Over Partially Ordered Sets
Copyright policy )On Sums Over Partially Ordered Sets
We establish a general theorem for reducing sums of type $\sum_{y\ge x} g(y)$ where $g$ is a mapping from a partially ordered set into an abelian group. Conclusions concern the Möbius function, the principle of inclusion-exclusion, the Tutte polynomial and Crapo's beta invariant.
- Humboldt-Universität zu Berlin Germany
Combinatorics of partially ordered sets, partially ordered set, Tutte polynomial, Möbius function, Exact enumeration problems, generating functions, matroid, Combinatorial aspects of matroids and geometric lattices, inclusion-exclusion principle, Combinatorial identities, bijective combinatorics
Combinatorics of partially ordered sets, partially ordered set, Tutte polynomial, Möbius function, Exact enumeration problems, generating functions, matroid, Combinatorial aspects of matroids and geometric lattices, inclusion-exclusion principle, Combinatorial identities, bijective combinatorics
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).0 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!