Restricted inversion sequences and enhanced 3-noncrossing partitions

DOI10.1016/j.ejc.2018.01.002zbMath1384.05045arXiv1706.07213OpenAlexW2963698320MaRDI QIDQ1746580

Zhicong Lin

Publication date: 25 April 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

generating functionTutte polynomialMotzkin numbersalgebraic seriesBaxter permutationsgeneating tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items (22)

Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li ⋮ On some combinatorial sequences associated to invariant theory ⋮ Consecutive patterns in inversion sequences II: avoiding patterns of relations ⋮ A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions ⋮ Enumeration of smooth inversion sequences and proof of a recent related conjecture ⋮ Inversion sequences avoiding pairs of patterns ⋮ Restricted inversion sequences and Schröder paths ⋮ On 0012-avoiding inversion sequences and a conjecture of Lin and Ma ⋮ Parameters in inversion sequences ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Unnamed Item ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Enumeration of inversion sequences avoiding triples of relations ⋮ Statistics on bargraphs of inversion sequences of permutations ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ A combinatorial bijection on \(k\)-noncrossing partitions ⋮ Further enumeration results concerning a recent equivalence of restricted inversion sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern avoidance in ascent sequences
• On partitions avoiding 3-crossings
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Some identities on the Catalan, Motzkin and Schröder numbers
• Crossings and nestings in tangled diagrams
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• Ascent sequences and 3-nonnesting set partitions
• Crossings and nestings of matchings and partitions
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Refined restricted inversion sequences

This page was built for publication: Restricted inversion sequences and enhanced 3-noncrossing partitions