Partitions of an Integer into Powers
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(17)- The lattice of integer partitions and its infinite extension
- An interesting way to partition a number
- An efficient representation of partitions of integers
- Partitions into \(k\)th powers of terms in an arithmetic progression
- Sandpile models and lattices: a comprehensive survey
- Sand piles models of signed partitions with d piles
- Computational aspects of ordered integer partitions with bounds
- Partitions and normal trees
- Parallel rank of two sandpile models of signed integer partitions
- Splitting of composite functors.
- Lattices of lattice paths
- The Euler binary partition function and subdivision schemes
- scientific article; zbMATH DE number 3929082 (Why is no real title available?)
- Newman cyclotomic polynomials, refinable splines and the Euler binary partition function
- The powers of two as sums over partitions
- PARTITIONS INTO PRIME POWERS
- Partitions and labeled trees
This page was built for publication: Partitions of an Integer into Powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331210)