Pattern-avoiding stabilized-interval-free permutations

DOI10.1016/J.DISC.2024.114329MaRDI QIDQ6658059zbMATH OpenFDO

Authors Daniel Birmajer, Juan B. Gil, Jordan Olliver Tirrell, Michael D. Weiner

Publication date 8 January 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114329

zbMATH Keywords

derangementindecomposablepattern avoidancepermutationstabilized-interval free

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2186873
• An asymptotic formula for the number of stabilized-interval-free permutations
• Refined restricted permutations
• Enumerating pattern avoidance for affine permutations
• scientific article; zbMATH DE number 6928921

Cites work

• Forests and pattern-avoiding permutations modulo pure descents
• scientific article; zbMATH DE number 2186873 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 6928921 (Why is no real title available?)
• scientific article; zbMATH DE number 3389044 (Why is no real title available?)
• Multiple pattern avoidance with respect to fixed points and excedances
• On pattern avoiding indecomposable permutations
• Patterns in permutations and words.
• Positroids and non-crossing partitions
• Refined restricted permutations
• Restricted permutations

Cited in

(1)

• An asymptotic formula for the number of stabilized-interval-free permutations

This page was built for publication: Pattern-avoiding stabilized-interval-free permutations

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