Displaying similar documents to “Integer Partitions, Tilings of 2D-gons and Lattices”

Integer partitions, tilings of 2 D -gons and lattices

Matthieu Latapy (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2 D -gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2 D -gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist. ...

Finding -partitions efficiently

Simone Dantas, Celina M.H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list,...