The number of distinct adjacent pairs in geometrically distributed words
A sequence of geometric random variables of length $n$ is a sequence of $n$ independent and identically distributed geometric random variables ($\Gamma_1, \Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for $1~\leq~j~\leq~n$ with $p+q=1.$ We study the number of distinct adjacent...
Main Authors: | Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Stephan Wagner, Mark Ward |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2021-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5686/pdf |
Similar Items
-
The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
by: Guy Louchard, et al.
Published: (2023-10-01) -
Enumerating two permutation classes by the number of cycles
by: Kassie Archer
Published: (2022-10-01) -
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
by: Colin Defant
Published: (2021-04-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
Two examples of Wilf-collapse
by: Michael Albert, et al.
Published: (2021-08-01)