The number of {1243, 2134}-avoiding permutations
We show that the counting sequence for permutations avoiding both of the (classical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences.
Main Author: | David Callan |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2023-03-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5287/pdf |
Similar Items
-
Permutations avoiding 4321 and 3241 have an algebraic generating function
by: David Callan
Published: (2022-12-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
Enumerating two permutation classes by the number of cycles
by: Kassie Archer
Published: (2022-10-01) -
Pattern Avoidance for Random Permutations
by: Harry Crane, et al.
Published: (2018-12-01) -
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
by: Hanna Mularczyk
Published: (2021-08-01)