OPUS


Enumerative Combinatorics in the Partition Lattice

  • The focus of this thesis lies on the application of enumerative combinatorics to the partition lattice n. Some ideas beyond enumerative combinatorics are used to examine the lattice properties of n. The combinatorial aspects involve the counting of chains in the partition lattice with the associated exponential generating functions and a new derivation of the Möbius function in n. Finally different representations of some simple sums ranging over intervals in the partition lattice are discussed.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Frank Simon
URN:urn:nbn:de:bsz:mit1-opus-682
Document Type:Master's Thesis
Language:German
Year of Completion:2009
Publishing Institution:Hochschule Mittweida
Release Date:2009/11/05
GND Keyword:Kombinatorik
Institutes:03 Mathematik / Naturwissenschaften / Informatik
Access Rights:Frei zugänglich
Licence (German):License LogoEs gilt das UrhG

$Rev: 13581 $