Related papers: A Bijection between classes of Fully Packed Loops …
We apply the loop module construction of arXiv:1504.05114 in the context of Lie colour algebras. We construct a bijection between the equivalence classes of all finite-dimensional graded irreducible Lie colour algebra representations from…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. The first result of this paper is a…
In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…
We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…
In a geometry, a maximal cap is a collection of points of largest size containing no lines. In AG(4,3), maximal caps contain 20 points. The 81 points of AG(4,3) can be partitioned into 4 mutually disjoint maximal caps together with a single…
In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…
A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…
We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.
The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…
The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial interpretation of these numbers. A combinatorial bijection…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one…
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…
The Shi arrangement ${\mathcal S}_n$ is the arrangement of affine hyperplanes in ${\mathbb R}^n$ of the form $x_i - x_j = 0$ or $1$, for $1 \leq i < j \leq n$. It dissects ${\mathbb R}^n$ into $(n+1)^{n-1}$ regions, as was first proved by…
We investigate in this paper the relation between Apollonian $d$-ball packings and stacked $(d+1)$-polytopes for dimension $d\ge 3$. For $d=3$, the relation is fully described: we prove that the $1$-skeleton of a stacked $4$-polytope is the…
In this short note we announce explicit equations of a fake projective plane in its bicanonical embedding in $\mathbb C\mathbb P^9$.
We define a bijection between triangulations of a convex polygon and $312$-avoiding permutations through the process of "ear-clipping". This bijection is then used to obtain a bijection between polygon dissections and a certain class of…
A non-empty subset A of X = X_1 x...x X_d is a (proper) box if A = A_1 x...x A_d and A_i is a (proper) subset of X_i for each i. Suppose that for each pair of boxes A, B and each i, one can only know which of the three states takes place:…