On avoiding 1233

DOI10.26493/2590-9770.1377.8e9zbMath1497.05006OpenAlexW3181348821MaRDI QIDQ5045252

Mark Shattuck, Toufik Mansour

Publication date: 4 November 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1377.8e9

zbMATH Keywords

kernel method\(k\)-ary wordsavoiding 1233

Mathematics Subject Classification ID

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

Cites Work

• The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
• Asymptotics of the number of \(k\)-words with an \(l\)-descent
• Finite automata and pattern avoidance in words
• The patterns of permutations
• Words restricted by patterns with at most 2 distinct letters
• On the number of permutations avoiding a given pattern
• Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
• Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
• Restricted permutations
• Permutations of a multiset avoiding permutations of length 3
• Unnamed Item
• Unnamed Item

This page was built for publication: On avoiding 1233