Geometrically Distributed Random Variables and Permutations Avoiding Consecutive \(3\)-Letter Patterns

Tuwani Albert Tshifhumulo1
1Tue JOHN KNOPFMACHER CENTRE FOR APPLICABLE ANALYSIS AND NUMBER THE- Ory, DEPARTMENT OF MATHEMATICS, UNIVERSITY OF THE WITWATERSRAND, JOHAN- NESBURG, 2050. SOUTH AFRICA.

Abstract

For words of length \(n\), generated by independent geometric random variables, we consider the probability that these words avoid a given consecutive \(3\)-letter pattern. As a consequence, we count permutations in \(S_n\) avoiding consecutive \(3\)-letter patterns.