Some enumerative results related to ascent sequences

DOI10.1016/j.disc.2013.10.006zbMath1278.05010arXiv1207.3755OpenAlexW2090855500MaRDI QIDQ393161

Toufik Mansour, Mark Shattuck

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationkernel methodNarayana numberascent sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (8)

Ascent sequences and 3-nonnesting set partitions ⋮ Efficient generation of restricted growth words ⋮ Catalan pairs and Fishburn triples ⋮ Ascent sequences avoiding pairs of patterns ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Transport of patterns by Burge transpose

Uses Software

• OEIS
• WILF
• HERB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• Patterns in permutations and words.
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Pattern avoidance in ascent sequences
• On partitions avoiding 3-crossings
• Ascent sequences and upper triangular matrices containing non-negative integers
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• On pattern-avoiding partitions
• Enumeration schemes and, more importantly, their automatic generation
• Generating functions for generating trees
• Ascent sequences and 3-nonnesting set partitions
• Crossings and nestings of matchings and partitions
• A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials

This page was built for publication: Some enumerative results related to ascent sequences