Ascent sequences and the binomial convolution of Catalan numbers

zbMATH Open1333.05014arXiv1408.6823MaRDI QIDQ2800761FDOQ2800761

Authors: Lara Pudwell 

Publication date: 18 April 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Abstract: In this paper, we consider two sets of pattern-avoiding ascent sequences: those avoiding both 201 and 210 and those avoiding 0021. In each case we show that the number of such ascent sequences is given by the binomial convolution of the Catalan numbers. The result for $201,210$-avoiders completes a family of results given by Baxter and the current author in a previous paper. The result for 0021-avoiders, together with previous work of Duncan, Steingr'{i}msson, Mansour, and Shattuck, completes the Wilf classification of single patterns of length 4 for ascent sequences.

Full work available at URL: https://arxiv.org/abs/1408.6823

Recommendations

• Restricted ascent sequences and Catalan numbers
• Pattern avoidance in ascent sequences
• Some enumerative results related to ascent sequences
• Ascent sequences avoiding pairs of patterns
• On 021-avoiding ascent sequences

zbMATH Keywords

pattern avoidance in ascent sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19)

Cited In (7)

• Patterns of relation triples in inversion and ascent sequences
• Alternating convolutions of Catalan numbers
• Restricted ascent sequences and Catalan numbers
• Difference ascent sequences
• Inversion sequences avoiding pairs of patterns
• Catalan continued fractions and increasing subsequences in permutations
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: Ascent sequences and the binomial convolution of Catalan numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800761)