Pattern Avoidance in Reverse Double Lists

MaRDI QIDQ4560200zbMATH OpenFDO

Authors Monica Anderson, Marika Diepenbroek, Alex Stoll, Lara Pudwell

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1704.08638, https://dmtcs.episciences.org/4919/pdf

zbMATH Keywords

permutation patternreverse double liststandard Young tableauWilf class

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Abstract: In this paper, we consider pattern avoidance in a subset of words on $1,1,2,2,dots,n,n$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate reverse double lists avoiding any permutation pattern of length at most 4 and completely determine the corresponding Wilf classes. For permutation patterns $ho$ of length 5 or more, we characterize when the number of $ho$-avoiding reverse double lists on $n$ letters has polynomial growth. We also determine the number of $1cdotsk$-avoiders of maximum length for any positive integer $k$.

Recommendations

• Pattern avoidance in double lists
• Pattern avoidance in inversion sequences
• Pattern avoidance by palindromes
• Doubled patterns with reversal are 3-avoidable
• Inversion sequences avoiding pairs of patterns
• Pattern avoidability with involution
• Avoidability of palindrome patterns
• Doubled patterns with reversal and square-free doubled patterns

Cited in

(5)

• On partially ordered patterns of length 4 and 5 in permutations
• Pattern avoidance in double lists
• Padded Lists Revisited
• Maximum size of reverse-free sets of permutations
• Packing patterns in symmetric words

This page was built for publication: Pattern Avoidance in Reverse Double Lists

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