Matthieu Latapy - Partitions of an Integer into Powers

dmtcs:2279 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) - https://doi.org/10.46298/dmtcs.2279
Partitions of an Integer into PowersArticle

Authors: Matthieu Latapy ORCID1

  • 1 Laboratoire d'informatique Algorithmique : Fondements et Applications

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In particular, we show that the set of these partitions can be ordered in a natural way which gives the distributive lattice structure to this set. We also give a tree structure which allow efficient and simple enumeration of the partitions of an integer.


Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Section: Proceedings
Published on: January 1, 2001
Imported on: November 21, 2016
Keywords: Integer partition,Composition,Lattice,Distributive Lattice,Discrete Dynamical Models,Chip Firing Game,[INFO] Computer Science [cs],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

3 Documents citing this article

Consultation statistics

This page has been seen 275 times.
This article's PDF has been downloaded 224 times.