Properties of triangular partitions and their generalizations

Authors

Keywords:

enumerative combinatorics, geometric combinatorics, triangular partitions, balanced words.

Abstract

An integer partition is said to be triangular if its Ferrers diagram can be separated from its complement (as a subset of N2) by a straight line. This article builds on some recent developments on the topic in order to derive new enumerative, geometric and algorithmic properties of these objects. The research is then extended to higher-dimensional generalizations, called pyramidal partitions, and to convex and concave partitions, defined as partitions whose Ferrers diagram can be separated from its complement by a convex or concave curve.

Downloads

Download data is not yet available.

Downloads

How to Cite

Galván, A. B. (2024). Properties of triangular partitions and their generalizations. Reports@SCM, 9(1), 31–40. Retrieved from https://revistes.iec.cat/index.php/reports/article/view/154339

Issue

Section

Articles