2024/08/13 by Giulio Cerbai, Cerbai, Giulio, Anders Claesson +3
Biochemistry, Genetics and Molecular Biology · #05A05 #05A19 #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2408.06959
openalex publication_date 2024/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.