[논문 리뷰] A Permutation Avoidance Game with Reverse Replies and Monotone Traps

Henning Úlfarsson|arXiv (Cornell University)|2026. 03. 16.

Game Theory and Applications인용 수 0

한 줄 요약

The paper analyzes an impartial game PAP where players ban length-k patterns from permutations, identifies a minimal monotone-forcing set B_k, proves a quadratic upper bound on the monotone-forcing threshold, and shows a reverse-reply winning strategy for k=4 and large n.

ABSTRACT

We study the impartial game PAP (``permutations avoiding patterns''), in which players take turns choosing patterns to avoid. We define a set of length $k$ patterns, $B_k$, and show that it is the unique minimal monotone-forcing subset of $S_k$: every sufficiently long permutation that avoids $B_k$ is monotone, and every monotone-forcing subset of $S_k$ must contain $B_k$. We prove a quadratic upper bound for the monotone-forcing threshold, and determine the exact thresholds for $k=3,4,5,6$. We use properties of the sets $B_k$ to prove that a reverse-reply strategy wins PAP on $S_n$ when $k=4$ for all $n \geq 10$; for $k=3$, the same strategy can be analysed directly. We conjecture that it is a winning strategy for all $k$ and $n$ sufficiently large.

연구 동기 및 목표

• Motivate the study of a two-player impartial game based on avoiding fixed permutation patterns.
• Identify the structural core B_k that forces monotonicity in large permutations.
• Determine monotone-forcing thresholds N_k and establish exact values for small k (k=3,4,5,6).
• Develop and apply a reverse-reply strategy to win PAP in large-n regimes.
• Provide computational verification and conjecture broad applicability to higher k.

제안 방법

• Define PAP on S_n with pattern length k and observe that only k! moves exist.
• Introduce the sets B_k and prove their minimality as monotone-forcing sets via witness families.
• Establish a quadratic upper bound for N_k and compute exact thresholds for small k (k=3..6).
• Prove that a reverse-reply strategy wins PAP on S_n for k=4 and n≥10 (and analyze k=3 directly).
• Use structural properties of B_k to validate the reverse-reply strategy and discuss conjectures for general k.
• Support results with computer-assisted verifications and provide code in a public repository.

실험 결과

연구 질문

• RQ1 What is the minimal monotone-forcing subset of S_k that governs long-run avoidance behavior?
• RQ2 Can a reverse-reply strategy win PAP on large n for fixed k, and under what conditions?
• RQ3 What are the monotone-forcing thresholds N_k, and how do they scale with k?
• RQ4 How do the witness families corresponding to B_k demonstrate minimality and endgame structure?
• RQ5 Do the results extend to larger k, or are there small-n obstructions that disappear asymptotically?

주요 결과

n	sg(S_n,1)	sg(S_n,2)	sg(S_n,3)	sg(S_n,4)
1	1	0	0	0
2	1	0	0	0
3	1	0	0	0
4	1	0	0	0
5	1	0	0	0
6	1	0	0	2
7	1	0	0	0
8	1	0	0	0
9	1	0	0	0
10	1	0	0	0

• B_k (consisting of eight specific k-patterns and their complements) is the unique minimal monotone-forcing subset of S_k.
• A quadratic upper bound for the monotone-forcing threshold N_k is established, with exact thresholds computed for k=3,4,5,6.
• For k=3, a reverse-reply strategy wins PAP on S_n for all n≥3.
• For k=4, the reverse-reply strategy works for n≥10, with smaller-n behavior showing anomalies (n=5–9) and a precise breakdown of when the strategy fails or succeeds.
• The paper proves a reverse-closed, monotone-free endgame structure enabling uniform reverse replies, and conjectures the reverse strategy extends to all k and sufficiently large n.
• Witness families demonstrate that each element of B_k is necessary for monotone-forcing; they also provide a mechanism to verify minimality.