Enumerating two permutation classes by the number of cycles

DOI10.46298/DMTCS.6173MaRDI QIDQ6102520zbMATH OpenFDO

Authors Kassie Archer

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/1803.08959

zbMATH Keywords

cyclesexcedancesfixed pointsinversionsinvolutionspattern avoidancepermutation statistics

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15)

Abstract: We enumerate permutations in the two permutation classes $ext{Av}_n(312,4321)$ and $ext{Av}_n(321,4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.

Recommendations

• Two permutation classes enumerated by the central binomial coefficients
• The enumeration of permutations avoiding 3124 and 4312
• The permutation class Av(4213,2143)
• Cycle-up-down permutations
• Equivalence classes of permutations modulo descents and left-to-right maxima

Cites work

• Analysis of casino shelf shuffling machines
• Bijections for refined restricted permutations
• Counting permutations with given cycle structure and descent set
• Cyclic permutations realized by signed shifts
• Enumeration of cyclic permutations in vector grid classes
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Fixed points and excedances in restricted permutations
• Generating trees and forbidden subsequences
• Multiple pattern avoidance with respect to fixed points and excedances
• Refined restricted involutions
• Refined restricted permutations
• Restricted involutions and Motzkin paths
• Restricted permutations
• The cycle enumerator of unimodal permutations
• The cyclic structure of unimodal permutations
• The X-class and almost-increasing permutations
• Unimodal permutations and almost-increasing cycles

Cited in

(10)

• Representation of permutations as products of two cycles
• Two enumerative results on cycles of permutations
• Enumeration of cyclic permutations in vector grid classes
• Enumeration of snakes and cycle-alternating permutations
• scientific article; zbMATH DE number 6521429 (Why is no real title available?)
• scientific article; zbMATH DE number 819115 (Why is no real title available?)
• Juxtaposing Catalan permutation classes with monotone ones
• Two permutation classes enumerated by the central binomial coefficients
• Cyclic permutations avoiding patterns in both one-line and cycle forms
• Pattern avoidance and the fundamental bijection

This page was built for publication: Enumerating two permutation classes by the number of cycles

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