On 0012-avoiding inversion sequences and a conjecture of Lin and Ma

DOI10.2989/16073606.2022.2039973MaRDI QIDQ6104976zbMATH OpenOpenAlexWikidataFDO

Authors Shane Chern

Publication date 26 June 2023

Published in Quaestiones Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

generating functioninversion sequencekernel methodpattern avoidance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: The study of pattern avoidance in inversion sequences recently attracts extensive research interests. In particular, Zhicong Lin and Jun Ma conjectured a formula that counts the number of inversion sequences avoiding the pattern $0012$. We will not only confirm this conjecture but also give a formula that enumerates the number of $0012$-avoiding inversion sequences in which the last entry equals $n-1$.

Recommendations

• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Inversion sequences avoiding pairs of patterns
• Pattern avoidance in inversion sequences
• Length-four pattern avoidance in inversion sequences
• Inversion sequences avoiding consecutive patterns

Cites work

• A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
• A sextuple equidistribution arising in pattern avoidance
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• Consecutive patterns in inversion sequences
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• Enumeration of inversion sequences avoiding triples of relations
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Inversion sequences avoiding pairs of patterns
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Patterns of relation triples in inversion and ascent sequences
• Restricted inversion sequences and enhanced 3-noncrossing partitions
• The kernel method: a collection of examples
• Vincular patterns in inversion sequences
• Wilf equivalences between vincular patterns in inversion sequences

Cited in

(12)

• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
• Restricted inversion sequences and Schröder paths
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• Inversion sequences avoiding a triple of patterns of 3 letters
• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
• Inversion sequences avoiding 021 and another pattern of length four
• An explicit bijection between the inversion sequences avoiding 0312 and 0321
• Signed inversion sequences avoiding a set of length-2 signed patterns
• Enumeration of inversion sequences avoiding 010 and some patterns of length four
• Inversion sequences avoiding 012 (001) and another pattern of length four

This page was built for publication: On 0012-avoiding inversion sequences and a conjecture of Lin and Ma

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