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. Enumeration of Dumon ...
Article

Enumeration of Dumont permutations avoiding certain four-letter patterns

Alexander Burstein ORCID, Opel Jones
Download article
Open on arXiv
Submitted on
February 28, 2020
Accepted on
May 12, 2021
Published on
July 6, 2021
Last modified on
March 31, 2025
Special issue 22
vol. 22:2, Permutation Patterns 2019
Special issues
DOI
10.46298/dmtcs.6174
License
arXiv.org - Non-exclusive license to distribute
Indicators
1058
Views
1097
Downloads

Enumeration of Dumont permutations avoiding certain four-letter patterns

Alexander Burstein ORCID, Opel Jones
Abstract
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
Keywords
  • Mathematics - Combinatorics
  • 05A05, 05A15
Preview
Loading PDF preview...