Related papers: Oscillating Rim Hook Tableaux and Colored Matching…
In the class of nonlinear one-parameter real maps we study those with bifurcation that exhibits period doubling cascade. The fixed points of such a map form a finite discrete real set with dimension (2^n)m, where m is the (odd) number of…
A perfect matching M in an edge-colored complete bipartite graph K_{n,n} is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of…
We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…
A well-labelled positive path of size n is a pair (p,\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \sigma of {1,2,...,n} such…
Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight…
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in…
Given a vertex colouring of the infinite $n$-ary Cantor tree with $m$ colours ($n,m\geq 2$), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite…
Let $C \subseteq [r]^m$ be a code such that any two words of $C$ have Hamming distance at least $t$. It is not difficult to see that determining a code $C$ with the maximum number of words is equivalent to finding the largest $n$ such that…
For integers $n, m$ with $n \geq 1$ and $0 \leq m \leq n$, an $(n,m)$-Dyck path is a lattice path in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ using up steps $(0,1)$ and down steps $(1,0)$ that goes from the origin $(0,0)$ to the…
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…
A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of…
We study $k$-tilings ($k$-tuples of domino tilings) of the Aztec diamond of rank $m$. We assign a weight to each $k$-tiling, depending on the number of dominos of certain types and the number of "interactions" between the tilings. Employing…
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…
Lattice paths are important tools on solving some combinatorial identities. This note gives a new bijection between unbalanced Dyck path (a path that never reaches the diagonal of the lattice) and NE (North and East only) lattice path from…
We fix $n$ and say a square in the two-dimensional grid indexed by $(x,y)$ has color $c$ if $x+y \equiv c \pmod{n}$. A {\it ribbon tile} of order $n$ is a connected polyomino containing exactly one square of each color. We show that the set…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do not contain a fixed-size northeast chain and a fixed-size…
We investigate certain measures induced by families of non-intersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abc-hexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained,…