Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Enumerating two perm ...
Article

Enumerating two permutation classes by the number of cycles

Kassie Archer (1)
(1) The University of Texas at Tyler, USA
Download article
Open on arXiv
Submitted on
February 28, 2020
Accepted on
September 8, 2022
Published on
October 27, 2022
Last modified on
March 27, 2025
Special issue 22
vol. 22:2, Permutation Patterns 2019
Special issues
DOI
10.46298/dmtcs.6173
License
arXiv.org - Non-exclusive license to distribute
Indicators
923
Views
1444
Downloads

Enumerating two permutation classes by the number of cycles

Kassie Archer (1)
(1) The University of Texas at Tyler, USA
Abstract
We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.
Keywords
  • Mathematics - Combinatorics
  • 05A05, 05A15
Mathematics Subject Classification 2020
  • 05A10 - Factorials, binomial coefficients, combinatorial functions
  • 05A15 - Exact enumeration problems, generating functions
Preview
Loading PDF preview...