Abstract
Let . We zipper-merge integer compositions with sums and , equal number of parts and initial entries equal at least to 1 and 2, respectively. This yields bitstrings with two initial zeros, remaining zeros and ones. Tensors whose entries are such bitstrings contain unique representations of all Dyck words of length . 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.