Start Date
April 2025
Location
MCD 208
Abstract
An ascent sequence, α=a1,a2,...,an, is a sequence of positive integers with a1= 0, and αk+1 ≤ asc(αk)+1. In this project we focused on counting the number of ascent sequences with specific properties. Our goal was to find a formula to calculate the number of ascent sequences with any set length, number of ascents, or other property. Additionally, we adjusted the definition of ascent sequences to count and study sequences of similar forms. This presentation will showcase our methods and our findings obtained through our research on ascent sequences.
Ascent Sequences: Recursive, Jumping, and Restricting
MCD 208
An ascent sequence, α=a1,a2,...,an, is a sequence of positive integers with a1= 0, and αk+1 ≤ asc(αk)+1. In this project we focused on counting the number of ascent sequences with specific properties. Our goal was to find a formula to calculate the number of ascent sequences with any set length, number of ascents, or other property. Additionally, we adjusted the definition of ascent sequences to count and study sequences of similar forms. This presentation will showcase our methods and our findings obtained through our research on ascent sequences.
