Restricted inversion sequences and enhanced 3-noncrossing partitions
From MaRDI portal
Publication:1746580
DOI10.1016/J.EJC.2018.01.002zbMATH Open1384.05045arXiv1706.07213OpenAlexW2963698320MaRDI QIDQ1746580FDOQ1746580
Authors: Zhicong Lin
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1706.07213
Recommendations
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crossings and nestings of matchings and partitions
- Crossings and nestings in tangled diagrams
- On partitions avoiding 3-crossings
- Ascent sequences and 3-nonnesting set partitions
- Pattern avoidance in ascent sequences
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Title not available (Why is that?)
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Some identities on the Catalan, Motzkin and Schröder numbers
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
Cited In (24)
- 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
- Inversion sequences avoiding 021 and another pattern of length four
- Enumeration of smooth inversion sequences and proof of a recent related conjecture
- Inversion sequences avoiding pairs of patterns
- Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
- Title not available (Why is that?)
- 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
- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
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)