As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic mean pattern occurrence and use them in conjunction with the probabilistic method to establish new results about the Ramsey theory of unavoidable patterns in the abelian full word case and in the nonabelian partial word case.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.