Permutations avoiding 4321 and 3241 have an algebraic generating function

DOI10.46298/DMTCS.5286MaRDI QIDQ6102519zbMATH OpenFDO

Authors David Callan

Publication date 23 June 2023

Published in Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1306.3193

zbMATH Keywords

indecomposablepattern avoidancepermutation diagram

Mathematics Subject Classification ID

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

Abstract: We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic generating function conjectured by Vladimir Kruchinin.

Cites work

• Analytic combinatorics
• Catalan Numbers
• Permutations with restricted patterns and Dyck paths
• Two vignettes on full rook placements

Cited in

(2)

• Passing through a stack \(k\) times with reversals
• Combinatorial exploration: an algorithmic framework for enumeration

This page was built for publication: Permutations avoiding 4321 and 3241 have an algebraic generating function

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