Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns.
Generalized pattern avoidance
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Penney's game for permutations
Computes winning probabilities for all pairs of length-3 permutations and some length-4 pairs in the permutation analogue of Penney's game, proves non-transitivity, and introduces bijections for consecutive patterns.