Abstract
We obtain an explicit formula for the total number of descents and levels in (cyclic) tensor words of arbitrary dimension. We also determine the maximal number of cyclic descents in cyclic tensor words. Furthermore, we establish a lower bound and an upper bound on the maximal number of descents in tensor words.
| Original language | English |
|---|---|
| Pages (from-to) | 44-49 |
| Number of pages | 6 |
| Journal | Discrete Mathematics Letters |
| Volume | 13 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 the authors.
Keywords
- generating function
- word
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics