Mathematics – Combinatorics
Scientific paper
2000-08-02
Mathematics
Combinatorics
To appear in LNCS special issue, proceedings of ORDAL'99. See http://www.liafa.jussieu.fr/~latapy
Scientific paper
In this paper, we use a simple discrete dynamical system to study the integers partitions and their lattice. The set of the reachable configurations equiped with the order induced by the transitions of the system is exactly the lattice of integer partitions equiped with the dominance ordering. We first explain how this lattice can be constructed, by showing its strong self-similarity property. Then, we define a natural extension of the system to infinity. Using a self-similar tree, we obtain an efficient coding of the obtained lattice. This approach gives an interesting recursive formula for the number of partitions of an integer, where no closed formula have ever been found. It also gives informations on special sets of partitions, such as length bounded partitions.
Latapy Matthieu
Phan Ha Duong
No associations
LandOfFree
The Lattice of integer partitions and its infinite extension does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Lattice of integer partitions and its infinite extension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Lattice of integer partitions and its infinite extension will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-403165