English

Representation of Dyck words in tensors that zipper merge contiguous integer compositions

Combinatorics 2022-04-05 v3

Abstract

Let 0<kZ0<k\in\mathbb{Z}. We zipper-merge integer compositions with sums kk and k+1k+1, equal number of parts and initial entries equal at least to 1 and 2, respectively. This yields bitstrings with two initial zeros, k1k-1 remaining zeros and kk ones. Tensors whose entries are such bitstrings contain unique representations of all Dyck words of length 2k2k. If rows and columns of such tensors are disposed in descending lexicographic order, then their entries not representing Dyck words form disjoint unions of descending staircases corresponding to strict lower triangular submatrices.

Keywords

Cite

@article{arxiv.2107.04584,
  title  = {Representation of Dyck words in tensors that zipper merge contiguous integer compositions},
  author = {Italo J. Dejter},
  journal= {arXiv preprint arXiv:2107.04584},
  year   = {2022}
}

Comments

12 pages, 3 figures, 11 figures