Pattern avoidance in poset permutations

DOI10.1007/s11083-015-9367-7zbMath1356.06002arXiv1208.5718OpenAlexW1593740639MaRDI QIDQ304187

Sam Hopkins, Morgan Weiler

Publication date: 24 August 2016

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5718

zbMATH Keywords

partially ordered setpattern avoidancepermutation patternlinear extension

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items (4)

Wilf equivalences for patterns in rooted labeled forests ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ Unnamed Item ⋮ Classical and consecutive pattern avoidance in rooted forests

Uses Software

• Sage-Combinat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern avoidance in ordered set partitions
• Consecutive patterns in permutations
• The number of linear extensions of the Boolean lattice
• Finite automata and pattern avoidance in words
• On \(abab\)-free and \(abba\)-free set partitions
• Priority queues and multisets
• Pattern avoidance in matchings and partitions
• On the number of permutations avoiding a given pattern
• Avoiding patterns of length three in compositions and multiset permutations
• Pattern avoidance in compositions and multiset permutations
• Partially ordered generalized patterns
• Restricted permutations
• Permutations of a multiset avoiding permutations of length 3
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Pattern avoidance in poset permutations