Fixed points of a random restricted growth sequence

DOI10.1016/J.DAM.2021.07.009MaRDI QIDQ2043371zbMATH OpenOpenAlexFDO

Authors Toufik Mansour, Reza Rastegar

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

zbMATH Keywords

fixed pointgenerating functionsprobabilistic samplingrestricted growth sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Abstract: We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by calculation of generating functions and leveraging a probabilistic sampling method.

Recommendations

• Fixed points in compositions and words
• Alphabetic points in restricted growth functions
• A note on fixed points of regular paper-floor sequences
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• Fixed points and matching points in partitions

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 3598475 (Why is no real title available?)
• scientific article; zbMATH DE number 686998 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• Elements protected by records in set partitions
• Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
• Fixed points in compositions and words
• Generation of a random partition of a finite set by an urn model
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Horizontal visibility graph of a random restricted growth sequence
• On a balanced property of derangements
• On fixed points of permutations.
• Permutations with extremal number of fixed points
• Records in set partitions
• The cycle structure of random permutations
• The largest and the smallest fixed points of permutations
• \(q\)-Stirling numbers: a new view

Cited in

(4)

• On Sara's dove bar habit
• scientific article; zbMATH DE number 7662495 (Why is no real title available?)
• Fixed points and matching points in partitions
• Fixed points in compositions and words

This page was built for publication: Fixed points of a random restricted growth sequence

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