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. Limit theorems for f ...
Article

Limit theorems for fixed point biased permutations avoiding a pattern of length three

Aksheytha Chelikavada ORCID (1), Hugo Panzo ORCID (2)
(1) DePaul University
(2) Saint Louis University [SLU]
Download article
Open on arXiv
Submitted on
March 18, 2025
Accepted on
January 8, 2026
Published on
March 9, 2026
Last modified on
March 9, 2026
Volume 28
vol. 28:2
Combinatorics
DOI
10.46298/dmtcs.15388
License
arXiv.org - Non-exclusive license to distribute
Indicators
1035
Views
216
Downloads

Limit theorems for fixed point biased permutations avoiding a pattern of length three

Aksheytha Chelikavada ORCID (1), Hugo Panzo ORCID (2)
(1) DePaul University
(2) Saint Louis University [SLU]
Abstract
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution towards favoring permutations with more or fewer fixed points than is typical under the uniform distribution. One case we study features a phase transition where the limiting distribution changes abruptly from negative binomial to Rayleigh to normal depending on the bias parameter. 17 pages, final version
Keywords
  • Probability
  • Combinatorics
  • 05A05, 60C05, 60F05 (Primary) 05A15, 68Q87 (Secondary)
Mathematics Subject Classification 2020
  • 05A05 - Permutations, words, matrices
  • 05A15 - Exact enumeration problems, generating functions
  • 05A16 - Asymptotic enumeration
  • 60C05 - Combinatorial probability
  • 60F05 - Central limit and other weak theorems
  • 68Q87 - Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Preview
Loading PDF preview...