On avoiding 1233
From MaRDI portal
Publication:5045252
Recommendations
- Counting 1324-avoiding permutations
- 1324-avoiding permutations revisited
- scientific article; zbMATH DE number 1215432
- Infinite prime avoidance
- scientific article; zbMATH DE number 750680
- scientific article; zbMATH DE number 2108134
- Patterns in random permutations avoiding the pattern 132
- Counting 1324, 4231-avoiding permutations
- On 1212-avoiding restricted growth functions
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Asymptotics of the number of \(k\)-words with an \(l\)-descent
- Enumeration schemes for words avoiding permutations
- Finite automata and pattern avoidance in words
- Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
- On the number of permutations avoiding a given pattern
- Permutations of a multiset avoiding permutations of length 3
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Restricted permutations
- The (ordinary) generating functions enumerating 123-avoiding words with r occurrences of each of 1, 2, , n are always algebraic
- The patterns of permutations
- Words restricted by patterns with at most 2 distinct letters
Cited in
(5)- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
- The (ordinary) generating functions enumerating 123-avoiding words with r occurrences of each of 1, 2, , n are always algebraic
- Restricted k-ary words and functional equations
- Words over a finite alphabet avoiding 1243
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
This page was built for publication: On avoiding 1233
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045252)
