The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
DOI10.46298/DMTCS.9293MaRDI QIDQ6599787FDOQ6599787
Authors: Guy Louchard, Werner Schachinger, Mark Daniel Ward 
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
asymptotic distributiongeometrically distributed wordsdistinct pairsequal pairsnumber of distinct adjacent pairs
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Combinatorics on words (68R15)
Cites Work
- GFUN
- Title not available (Why is that?)
- Analytic combinatorics
- Mellin transforms and asymptotics: Harmonic sums
- Asymptotics of the moments of extreme-value related distribution functions
- Non-negative matrices and Markov chains. 2nd ed
- Distinctness of compositions of an integer: A probabilistic analysis
- On a Correlation Inequality of Farr
- The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
- The number of distinct adjacent pairs in geometrically distributed words
- Counting occurrences for a finite set of words
This page was built for publication: The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599787)
