Related papers: Enumerations and Bijections for Stanley Polyominoe…

Two subfamilies of Motzkin paths, with the same numbers of up, down, horizontal steps were known to be equinumerous with ternary trees and related objects. We construct a bijection between these two families that does not use any auxiliary…

Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux and m-colored matchings, where m is a positive integer. An…

We develop combinatorial tools to study the relationship between the Stanley depth of a monomial ideal $I$ and the Stanley depth of its compliment, $S/I$. Using these results we are able to prove that if $S$ is a polynomial ring with at…

A permutomino of size n is a polyomino determined by a pair of permutations of size n+1, such that they differ in each position. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the…

We give a purely combinatorial characterization of complete Stanley-Reisner rings having principally generated (equivalently, finitely generated) Cartier algebras.

In this paper we study depth and Stanley depth of the edge ideals and quotient rings of the edge ideals, associated to classes of graphs obtained by taking the strong product of two graphs. We consider the cases when either both graphs are…

Let $I$ be an $m$-generated complete intersection monomial ideal in $S=K[x_1,...,x_n]$. We show that the Stanley depth of $I$ is $n-\floor{\frac{m}{2}}$. We also study the upper-discrete structure for monomial ideals and prove that if $I$…

Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is…

The class of fighting fish is a recently introduced model of branching surfaces generalizing parallelogram polyominoes. We can alternatively see them as gluings of cells, walks on the square lattice confined to the quadrant or shuffle of…

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

Regarding a Dynkin diagram as a specific point-line incidence structure (where each line has just two points), one can associate with it a Veldkamp space. Focusing on extended Dynkin diagrams of type $\widetilde{D}_n$, $4 \leq n \leq 8$, it…

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…

We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…

This paper explores a factorization using bidiagonal matrices of the recurrence matrix of Hahn multiple orthogonal polynomials. The factorization is expressed in terms of ratios involving the generalized hypergeometric function ${}_3F_2$…

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

We construct a refined bijection $\phi$ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation $\pi$ is equal to the first vertex in $\phi(\pi)$ in…

We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of…

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…