Related papers: Non-overlapping Dyck matrices
Spontaneous mirror symmetry violation is carried out in nature as the transition between the usual left (right)-handed and the mirror right (left)-handed spaces, in each of which the usual and mirror particles have the different lifetimes.…
We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…
There are three classical lattices on the Catalan numbers: the Tamari lattice, the lattice of noncrossing partitions and the lattice of Dyck paths. The first is known to be isomorphic to the lattice of torsion classes of the path algebra of…
We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.
Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…
Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…
Let $0<k\in\mathbb{Z}$. We zipper-merge integer compositions with sums $k$ and $k+1$, equal number of parts and initial entries equal at least to 1 and 2, respectively. This yields bitstrings with two initial zeros, $k-1$ remaining zeros…
Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…
The paper studies the set of all square binary matrices containing an exact number of 1's in each rows and in each column. A connection is established between the cardinal number of this set and the cardinal number of its subset of matrices…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
A Catalan word is one on the alphabet of positive integers starting with $1$ in which each subsequent letter is at most one more than its predecessor. Let $\mathcal{C}_n$ denote the set of Catalan words of length $n$. In this paper, we give…
A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…