Partitions of an Integer into Powers

01/20/2021
by   Matthieu Latapy, et al.
0

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.

READ FULL TEXT
research
12/11/2019

Integer Partitions Probability Distributions

Two closely related discrete probability distributions are introduced. I...
research
06/25/2020

Tangles: From Weak to Strong Clustering

We introduce a new approach to clustering by using tangles, a tool that ...
research
11/19/2020

Cluster structure of optimal solutions in bipartitioning of small worlds

Using a simulated annealing, we examine a bipartitioning of small worlds...
research
08/31/2023

Erdős–Ko–Rado type results for partitions via spread approximations

In this paper, we address several Erdős–Ko–Rado type questions for famil...
research
07/27/2020

Unfolding cubes: nets, packings, partitions, chords

We show that every ridge unfolding of an n-cube is without self-overlap,...
research
09/09/2010

Probabilistic Models over Ordered Partitions with Application in Learning to Rank

This paper addresses the general problem of modelling and learning rank ...
research
03/26/2021

Some properties of the parking function poset

In 1980, Edelman defined a poset on objects called the noncrossing 2-par...

Please sign up or login with your details

Forgot password? Click here to reset