Avoidance of vincular patterns by flattened derangements

MaRDI QIDQ7321452zbMATH OpenFDO

Authors Toufik Mansour, Mark Shattuck

Publication date 28 August 2026

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Full work available at URL https://jalc.de/issues/2025/issue_30_4/jalc-2025-249-275.php

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Counting subwords in flattened permutations
• Flattened Catalan words
• Flattened Stirling permutations
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2214405 (Why is no real title available?)
• scientific article; zbMATH DE number 7732129 (Why is no real title available?)
• Kernel method and linear recurrence system
• Pattern avoidance in ``flattened partitions
• Pattern avoidance in flattened derangements
• Pattern avoidance in flattened permutations
• Patterns in permutations and words.
• Recurrence relations for patterns of type (2,1) in flattened permutations
• Refined restricted permutations
• Refined restricted permutations avoiding subsets of patterns of length three

This page was built for publication: Avoidance of vincular patterns by flattened derangements

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