Name
Abstract | ||
|---|---|---|
In this paper we consider doubly symmetric Dyck words, i.e. Dyck words which are fixed by two symmetry operations alpha and beta introduced in [1]. We study combinatorial properties of doubly symmetric Dyck words, leading to the definition of two recursive algorithms to build these words. As a consequence we have a representation of doubly symmetric Dyck words as vectors of integers, called track vectors. Finally, we show some bijections between a subfamily of doubly symmetric Dyck words and a subfamily of integer partitions. The computation of the sequence f(n) of doubly symmetric Dyck words of semi-length n shows surprising properties giving rise to some conjectures. (C) 2021 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.tcs.2021.10.006 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
Dyck languages, Enumerative combinatorics, Integer sequences | Journal | 896 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Cori | 1 | 55 | 11.15 |
| Andrea Frosini | 2 | 101 | 20.44 |
| Giulia Palma | 3 | 0 | 1.01 |
| Elisa Pergola | 4 | 0 | 0.34 |
| Simone Rinaldi | 5 | 0 | 1.35 |