The total number of descents and levels in (cyclic) tensor words | [Discrete Mathematics Letters • 2024]

Author(s):

1. Sela Fried: Department of Computer Science, Israel Academic College,52275 Ramat Gan,Israel

2. Toufik Mansour: Department of Mathematics, University of Haifa,3103301 Haifa,Israel

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.

Page(s): 44-49

DOI: 10.47443/dml.2023.218

Published: Journal: Discrete Mathematics Letters, Volume: 13, Issue: 0, Year: 2024

Keywords:

Generating Function , Word

References:

[1] Baril J.-L.,Kirgizov S.,Vajnovszki V.,Kitaev S.,Mansour T.,Remmel J.,Knopfmacher A.,Mansour T.,Munagi A.,Prodinger H.,Mansour T.,Shattuck M.,N. J. A. Sloane, M. .2010 .The On-Line Encyclopedia of Integer Sequences, OEIS Foundation Inc. Online J. Anal. Comb, 9(2014) : 1-18.

Citations

Downloads

Views