The lattice of integer partitions and its infinite extension

From MaRDI portal
Publication:1024442

DOI10.1016/J.DISC.2008.02.002zbMATH Open1168.05007arXivmath/0008020OpenAlexW1973900801MaRDI QIDQ1024442FDOQ1024442

Thi Ha Duong Phan, Matthieu Latapy

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all partitions of an integer, equipped with a dominance ordering. We first explain how this lattice can be constructed by an algorithm in linear time with respect to its size by showing that it has a self-similar structure. Then, we define a natural extension of the model to infinity, which we compare with the Young lattice. Using a self-similar tree, we obtain an encoding of the obtained lattice which makes it possible to enumerate easily and efficiently all the partitions of a given integer. This approach also gives a recursive formula for the number of partitions of an integer, and some informations on special sets of partitions, such as length bounded partitions.


Full work available at URL: https://arxiv.org/abs/math/0008020




Recommendations




Cites Work


Cited In (20)





This page was built for publication: The lattice of integer partitions and its infinite extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024442)