Pattern avoidance and the fundamental bijection

DOI10.37236/13748MaRDI QIDQ6901243zbMATH OpenFDO

Authors Kassie Archer, Robert P. Laudone

Publication date 12 November 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13748

zbMATH Keywords

permutations avoiding a pattern of size 3

Mathematics Subject Classification ID

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

Cites work

• An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
• Enumerating two permutation classes by the number of cycles
• Enumeration of cyclic permutations in vector grid classes
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• Links and the Diaconis-Graham inequality
• Pattern-avoiding permutation powers
• Pattern-functions, statistics, and shallow permutations
• Pattern-restricted permutations composed of 3-cycles
• Pattern-restricted permutations of small order
• Refined restricted involutions
• Restricted 123-involutions
• Restricted permutations
• Turning cycle restrictions into mesh patterns via Foata's fundamental transformation

Cited in

(1)

• Cyclic permutations avoiding patterns in both one-line and cycle forms

This page was built for publication: Pattern avoidance and the fundamental bijection

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