Permutation patterns and cell decompositions

DOI10.1007/s11786-018-0353-5zbMath1462.05023OpenAlexW2810221223MaRDI QIDQ2319453

Matthias Schork, Toufik Mansour

Publication date: 19 August 2019

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-018-0353-5

zbMATH Keywords

permutationpattern avoidanceWilf-equivalence

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Uses Software

• InsEnc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding regular insertion encodings for permutation classes
• Forbidden subsequences
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Generating trees and the Catalan and Schröder numbers
• Classification of forbidden subsequences of length 4
• Finitely labeled generating trees and restricted permutations
• Wilf classes of pairs of permutations of length 4
• The insertion encoding of permutations
• Which Schubert varieties are local complete intersections?
• Wilf classification of triples of 4-letter patterns
• Consequences of the Lakshmibai-Sandhya Theorem: the ubiquity of permutation patterns in Schubert calculus and related geometry
• Pattern avoidance and fiber bundle structures on Schubert varieties
• Restricted permutations

This page was built for publication: Permutation patterns and cell decompositions