GPT-6 Pro proves a quadratic-size threshold suffices for random permutations to contain every length-n pattern
The paper proves that a uniformly random permutation of length 32n² contains every permutation of length n as a pattern with probability at least 1−exp(−c n/log n), for an absolute c>0 and sufficiently large n. This removes the prior log-log factor from the sufficient-length bound, resolves Alon’s open 1000n² problem, and establishes the correct Θ(n²) order.
Technology: OpenAI GPT-6 Pro
Family GPT-6: profile · models page
Publication: Preprint · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: direct test
- Tested: The paper proves that a uniformly random permutation of length 32n² contains every permutation of length n as a pattern with probability at least 1−exp(−c n/log n), for an absolute c>0 and sufficiently large n.
- Still unknown: ArXiv preprint. Authors report checking and digesting the proof; no separate independent validation is claimed here. The result is an asymptotic sufficient bound with constant 32 (the paper explains the constant can be reduced to any value greater than 1), not a sharp threshold constant.
- AI role: The authors state that GPT-6 Pro found the proof; they do not claim credit for its proof ideas, and say they verified and digested it and take responsibility for the manuscript.
Evidence sources: https://arxiv.org/abs/2610.13530
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.