Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been enumerated by counting orbits under the action of the dihedral group D4, of symmetries of the square, on (translation-type) convex polyominoes. Asymmetric convex polyominoes were also enumerated using Moebius inversion in the lattice of subgroups of D4. Here we extend these results to the subclass of parallelogram polyominos using a subgroup D2 of D4 which acts of this class.
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating function of periodic parallelogram polyominoes with respect to the height, the width and the intrinsic thickness, a new statistic unrelated to the existing statistics on parallelogram polyominoes. Moreover we define a rotation over periodic parallelogram polyominoes, which induces a partitioning in equivalent classes called strips. We also compute the generating …
The aim of this work is the study of the class of periodic parallelogram polyominoes, and two of its variantes. These objets are related to 321-avoiding affine permutations. We first provide a bijection with the set of triangles under Dyck paths. We then prove the ultimate periodicity of the generating series of our objects, and introduced a notion of primitive polyominoes, which we enumerate. We conclude by an asymptotic analysis.
This paper establishes connections between EW-tableaux and parallelogram polyominoes by using recent research regarding the sandpile model on the complete bipartite graph. This paper presents and proves a direct bijection between rectangular EW-tableaux and labelled ribbon parallelogram polyominoes. The significance of this is that allows one to move between these objects without the need for `recurrent configurations', the central object which previously tied this work together. It introduces the notion of a marked rectangular EW-tableaux that exactly encode all recurrent configurations of th…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n (the labels) are bijectively attached to the $n$ north steps of the above-bounding path, with the condition that they appear in increasing values along consecutive north steps. We calculate the Frobenius characteristic of the action of the symmetric group S_n on these labels. All these enumeration results are refined to take into account the area of these p…
We classify recurrent configurations of the sandpile model on the complete bipartite graph K_{m,n} in which one designated vertex is a sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a m*n rectangle. Several special types of recurrent configurations and their properties via this bijection are examined. For example, recurrent configurations whose sum of heights is minimal are shown to correspond to polyominoes of least area. Two other classes of recurrent configurations are shown to be related to bicomposition matrice…
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle Δ_{h_m} e_{n+1}, s_{k+1,1^{n-k}} \rangle$, extending in this way the work in (Aval et al. 2014). Also, we provide a bijective connection between decorated parallelogram polyominoes and decorated labelled Dyck paths, which allows us to prove the combinatorial interpretation of the coefficient $\langleΔ_{e_{m+n-k-1}}'e_{m+n}, h_m h_n \rangle$ predicted by the Delta conjecture in (Haglund et al. 2015). Finally, we define a statistic pmaj on partially la…
We study the statistics area, bounce and dinv on the set of parallelogram polyominoes having a rectangular m times n bounding box. We show that the bi-statistics (area, bounce) and (area, dinv) give rise to the same q,t-analogue of Narayana numbers which was introduced by two of the authors in [arXiv:1208.0024]. We prove the main conjectures of that paper: the q,t-Narayana polynomials are symmetric in both q and t, and m and n. This is accomplished by providing a symmetric functions interpretation of the q,t-Narayana polynomials which relates them to the famous diagonal harmonics.
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle Δ_{h_m} e_{n+1},s_{k+1,1^{n-k}}\rangle$, extending in this way the work in (Aval et al. 2014). Also, we provide a bijective connection between decorated parallelogram polyominoes and decorated labelled Dyck paths, which allows us to prove the combinatorial interpretation of the coefficient $\langle Δ_{e_{m+n-k-1}}'e_{m+n},h_m h_n\rangle$ predicted by the Delta conjecture in (Haglund et al. 2015). Finally, we define a statistic pmaj on partially label…
We provide a new succession rule (i.e. generating tree) associated with Schröder numbers, that interpolates between the known succession rules for Catalan and Baxter numbers. We define Schröder and Baxter generalizations of parallelogram polyominoes, called slicings, which grow according to these succession rules. In passing, we also exhibit Schröder subclasses of Baxter classes, namely a Schröder subset of triples of non-intersecting lattice paths, a new Schröder subset of Baxter permutations, and a new Schröder subset of mosaic floorplans. Finally, we define two families of subclasses of Bax…
We present a conjecture about the reduced Hilbert series of the coordinate ring of a simple polyomino in terms of particular arrangements of non-attacking rooks that can be placed on the polyomino. By using a computational approach, we prove that the above conjecture holds for all simple polyominoes up to rank $11$. In addition, we prove that the conjecture holds true for the class of parallelogram polyominoes, by looking at those as simple planar distributive lattices. Finally, we give a combinatorial interpretation of the Gorensteinnes of parallelogram polyominoes.
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons. Additionally we give a table of the numbers $a_k(n)$ for small $k$ and $n$ obtained by computer enumeration. We finish with some open problems for $k$-polyominoes.
We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study different families of directed convex polyominoes: symmetric polyominoes, parallelogram polyominoes. In this paper, we apply our method to determine the generating function for directed k-convex polyominoes. We show it is a rational function and we study its asymptotic behavior.
Motivated by some binomial coefficients identities encountered in our approach to the enumeration of convex polyominoes, we prove some more general identities of the same type, one of which turns out to be related to a strange evaluation of ${}_3F_2$ of Gessel and Stanton.
This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries of the square acting on (translation- type) polyominoes. In virtue of Burnside's Lemma, it is sufficient to enumerate the various symmetry classes (fixed points) of polyominoes defined by the elements of C4 and D4. Using the Temperley--Bousquet-Melou methodology, we solve this problem and provide explicit or recursive formulas for their generating functions according to width, height and area. We …
In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from a recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to be rational. Noting that this generating function can be expressed in terms of the Fibonacci polyno…
We study $321$-avoiding affine permutations, and prove a formula for their enumeration with respect to the inversion number by using a combinatorial approach. This is done in two different ways, both related to Viennot's theory of heaps. First, we encode these permutations using certain heaps of monomers and dimers. This method specializes to the case of affine involutions. For the second proof, we introduce periodic parallelogram polyominoes, which are new combinatorial objects of independent interest. We enumerate them by extending the approach of Bousquet-Mélou and Viennot used for classica…
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n^2}{12}+\frac{n\sqrt{n}}{3\sqrtπ} -\frac{(21π-16)n}{12π}.$ B) the average number of boundary vertices with degree two …
In this paper, we enumerate parallelogram polycubes according to several parameters. After establishing a relation between Multiple Zeta Function and the Dirichlet generating function of parallelogram polyominoes, we generalize it to the case of parallelogram polycubes. We also give an explicit formula and an ordinary generating function of parallelogram polycubes according to the width, length and depth, by characterizing its projections. Then, these results are generalized to polyhypercubes.
The purpose of this short paper is to put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the enumeration of increasing and decreasing chains of length 2 in fillings of moon polyominoes.
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the generating series of free (i.e. up to reflection and rotation) and of asymmetric convex hexagonal polyominoes, according to area and half-perimeter. We give explicit formulas or implicit functional equations for the generating series, which are convenient for computer algebra.
We put recent results on the symmetry of the joint distribution of the numbers of crossings and nestings of two edges over matchings, set partitions and linked partitions, in the larger context of the enumeration of increasing and decreasing chains of length 2 in fillings of moon polyominoes.
This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of them is a recursive description of the polyominoes which then translates into a functional equation satisfied by the generating function. The first approach applies to classes of polyominoes having a linear recursive structure and results in a rational generating function. The second approach applies to classes of polyominoes having an algebraic recursive st…
A polyomino is a finite, edge-connected set of cells in the plane. At the present time, an enumeration of all polyominoes is nowhere in sight. On the other hand, there are several subsets of polyominoes for which generating functions are known. For example, there exists extensive knowledge about column-convex polyominoes, a model introduced by Temperley in 1956. While studying column-convex polyominoes, researchers also gave a look at diagonally convex polyominoes (DCPs), but noticed an awkward feature: when the last diagonal of a DCP is deleted, the remaining object is not always a polyomino.…
