Restricted inversion sequences and enhanced 3-noncrossing partitions
From MaRDI portal
(Redirected from Publication:1746580)
Abstract: We prove a conjecture due independently to Yan and Martinez--Savage that asserts inversion sequences with no weakly decreasing subsequence of length and enhanced -noncrossing partitions have the same cardinality. Our approach applies both the generating tree technique and the so-called obstinate kernel method developed by Bousquet-M'elou. One application of this equinumerosity is a discovery of an intriguing identity involving numbers of classical and enhanced -noncrossing partitions.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- scientific article; zbMATH DE number 5204618 (Why is no real title available?)
- Ascent sequences and 3-nonnesting set partitions
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Crossings and nestings in tangled diagrams
- Crossings and nestings of matchings and partitions
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- On partitions avoiding 3-crossings
- Pattern avoidance in ascent sequences
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Some identities on the Catalan, Motzkin and Schröder numbers
Cited in
(24)- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Pattern-avoiding inversion sequences and open partition diagrams
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- On some combinatorial sequences associated to invariant theory
- Enumeration of inversion sequences avoiding triples of relations
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Enumeration of smooth inversion sequences and proof of a recent related conjecture
- Inversion sequences avoiding 021 and another pattern of length four
- Inversion sequences avoiding pairs of patterns
- Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
- scientific article; zbMATH DE number 7708728 (Why is no real title available?)
- Restricted inversion sequences and Schröder paths
- On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
- Statistics on bargraphs of inversion sequences of permutations
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Inversion sequences avoiding a triple of patterns of 3 letters
- A combinatorial bijection on \(k\)-noncrossing partitions
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Parameters in inversion sequences
This page was built for publication: Restricted inversion sequences and enhanced 3-noncrossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746580)