Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding

DOI10.37236/12686zbMATH Open1548.05018MaRDI QIDQ6614156

Henning Úlfarsson, Christian Bean, Émile Nadeau, Jay Pantone

Publication date: 7 October 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

permutation classespermutation size

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Patterns in permutations and words.
• Finding regular insertion encodings for permutation classes
• Generating permutations with restricted containers
• Permutations avoiding certain partially-ordered patterns
• On partially ordered patterns of length 4 and 5 in permutations
• Partially ordered generalized patterns
• The insertion encoding of permutations
• On permutations avoiding partially ordered patterns defined by bipartite graphs
• Large infinite antichains of permutations
• Permutation classes
• The on-line encyclopedia of integer sequences
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Simple marked mesh patterns
• Restricted permutations
• A bijection for length-5 patterns in permutations

This page was built for publication: Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding