On 021-Avoiding Ascent Sequences

2012/06/13 by William Y. C. Chen, Chen, William Y. C., Alvin Y. L. Dai +7 · 1 citation
Computer Science · Mathematics · #05A05 #05A19 #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1206.2849

openalex publication_date 2012/06/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes and Kitaev in their study of (\bf2+2)-free posets. An ascent sequence of length n is a nonnegative integer sequence x=x₁x₂... x_n such that x₁=0 and x_i≤ \asc(x₁x₂...x_i-1)+1 for all 1<i></i>

Citations

• Simple permutations and pattern restricted permutations

Cited by

• On ascent sequences avoiding 021 and a pattern of length four

Related

• Pattern avoidance in ascent sequences
• On Ascent, Repetition and Descent Sequences
• p-Ascent Sequences
• Ascent sequences avoiding pairs of patterns
• Ascent sequences and 3-nonnesting set partitions