arXiv:2408.06959 [math.CO]AbstractReferencesReviewsResources
Self-modified difference ascent sequences
Giulio Cerbai, Anders Claesson, Bruce E. Sagan
Published 2024-08-13Version 1
Ascent sequences play a key role in the combinatorics of Fishburn structures. Difference ascent sequences are a natural generalization obtained by replacing ascents with $d$-ascents. We have recently extended the so-called hat map to difference ascent sequences, and self-modified difference ascent sequences are the fixed points under this map. We characterize self-modified difference ascent sequences and enumerate them in terms of certain generalized Fibonacci polynomials. Furthermore, we describe the corresponding subset of $d$-Fishburn permutations.
Comments: 22 pages, 2 tables
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2406.12610 [math.CO] (Published 2024-06-18)
Modified difference ascent sequences and Fishburn structures
arXiv:0710.5168 [math.CO] (Published 2007-10-26)
The $X$-class and almost-increasing permutations
arXiv:1502.05340 [math.CO] (Published 2015-02-18)
Sieved Enumeration of Interval Orders and Other Fishburn Structures