Pattern avoiding permutations enumerated by inversions

DOI10.46298/DMTCS.14437MaRDI QIDQ6876032zbMATH OpenFDO

Authors Atli Fannar Franklín

Publication date 13 January 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.14437

zbMATH Keywords

combinatoricsindecomposable permutationsinversionspattern avoiding permutations

Mathematics Subject Classification ID

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

Cites work

• A CAT algorithm for generating permutations with a fixed number of inversions
• A combinatorial problem in geometry.
• Catalan continued fractions and increasing subsequences in permutations
• Coherent cohomology on Schubert subschemes of flag schemes and applications
• Convex n-ominoes
• Counting pattern-avoiding integer partitions
• Hilbert functions of graded algebras
• scientific article; zbMATH DE number 3389044 (Why is no real title available?)
• On pattern avoiding indecomposable permutations
• Permutation patterns and statistics
• Restricted permutations
• Some permutations with forbidden subsequences and their inversion number
• The Editor's Corner: n Coins in a Fountain
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

This page was built for publication: Pattern avoiding permutations enumerated by inversions

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