On d-permutations and pattern avoidance classes

DOI10.1007/S00026-024-00695-1MaRDI QIDQ6621948zbMATH OpenFDO

Authors Nathan Sun

Publication date 21 October 2024

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00026-024-00695-1

zbMATH Keywords

\(d\)-permutationspattern avoidancepermutations

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7640030
• On multi-avoidance of generalized patterns.
• Singleton mesh patterns in multidimensional permutations
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• Pattern-restricted permutations composed of 3-cycles

Cites work

• Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
• Enumeration and Wilf-classification of permutations avoiding four patterns of length 4
• Generating trees and the Catalan and Schröder numbers
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 7640030 (Why is no real title available?)
• On the diagram of 132-avoiding permutations
• Permutations with restricted patterns and Dyck paths
• Permuting machines and priority queues
• Restricted permutations
• Separable \(d\)-permutations and guillotine partitions

Cited in

(1)

• Singleton mesh patterns in multidimensional permutations

This page was built for publication: On \(d\)-permutations and pattern avoidance classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621948)