Fixed points of a random restricted growth sequence
From MaRDI portal
Publication:2043371
DOI10.1016/j.dam.2021.07.009zbMath1469.05011arXiv2012.06891OpenAlexW3179347372MaRDI QIDQ2043371
Publication date: 2 August 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06891
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- \(q\)-Stirling numbers: a new view
- On a balanced property of derangements
- The largest and the smallest fixed points of permutations
- Records in set partitions
- Permutations with extremal number of fixed points
- On fixed points of permutations.
- Generation of a random partition of a finite set by an urn model
- The cycle structure of random permutations
- Horizontal visibility graph of a random restricted growth sequence
- Elements protected by records in set partitions
- Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
This page was built for publication: Fixed points of a random restricted growth sequence