Critical permutations of the symmetric group: a local test for the first degree, and the first-degree counts at n=8 and n=9
Abstract
For τ in the symmetric group Sₙ let Λ(τ)={σ:σ ≤ τ} be its principal ideal in the Bruhat order and let λⱼ(τ) be the number of elements of Λ(τ) of Coxeter length j. Following Pučinskaitė, τ is critical of degree i when i is the least index with λᵢ(τ) ≠ λ_(ℓ(τ)-i)(τ), and critical when such an i exists; equivalently, when the rank generating function of the lower Bruhat interval [id,τ] is not palindromic. The set Cₙ of critical permutations is identified in that paper with {q ∈ Sₙ:[M(idₙ):L(q)] ≥ 2} in the principal block of O(slₙ(ℂ)), and its table of |Cₙ| stops at n=7. We prove that criticality of the first degree is decided by a condition local to τ: the two quantities the criterion compares are the number of smaller neighbours of τ and the number of indices j with τ({1,…,j}) ≠ {1,…,j}, so no principal ideal need be built. This yields the number of permutations critical of degree 1 at n=8 and at n=9, namely 32 915 and 329 513; the second is out of reach of the ideal-based route. The set Cₙ itself is classical — palindromicity of that rank generating function is the Carrell–Peterson criterion for rational smoothness, so by Lakshmibai–Sandhya Cₙ is the set of permutations containing 3412 or 4231, and |Cₙ| is n! less a known sequence — but that description is silent about the degree, and neither count above follows from it. We also adjudicate an internal inconsistency in the source, which prints both 354 and 345 for |C₆|: the value is 354, as the source's own arithmetic and the classical count both show. Every theorem, proposition, lemma and corollary below is machine-checked in Lean 4; the few numerical remarks that are not are flagged where they occur.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
18f31a9fe743ba695e084a55631f593297bd6cb866cd50913b26976f19970ba4
Claim ledger
Stated results
critperms-01routine2026-08-23
The source's definitions transcribed, with Lambda(tau) computed from the source's own covering relation and no rank-matrix criterion
critperms-02known data2026-08-23
|Cₙ| = 0, 0, 2, 32, 354 for n = 2, 3, 4, 5, 6
critperms-03known data2026-08-23
ERRATUM: the source's '345' is wrong; |C₆| = 354
critperms-04known data2026-08-23
Degree splits: 1:2 at n = 4, 1:31, 2:1 at n = 5, 1:341, 2:12, 3:1 at n = 6
critperms-05known data2026-08-23
|C₇| = 3488, split 1:3379, 2:96, 3:12, 4:1
critperms-06candidate2026-08-23
n = 8: 32,915 permutations of S₈ are critical of degree 1
critperms-07routine2026-08-23
A certificate-checked memoised principal ideal: any table passing CheckTab stores exactly sigma <= tau: keep sigma
critperms-08routine2026-08-23
The top level of Lambda(tau) is a singleton; the level below it is Nₛ(tau); first-degree criticality needs only levels 0 and 1
critperms-n1routine2026-08-23
Negative control: the source's (3412) and (4231) are critical, with its displayed |Nₛ| = 4!= 3 = |Lₜ|
critperms-n2routine2026-08-23
Negative control: the identity and (2413) are not critical, and nothing of length <= 3 is
critperms-n3routine2026-08-23
Negative control: the minimality clause is not idle – (45312) is critical of degree 2 and NOT of degree 1, and q₆ = (564312) of degree 3 and neither 1 nor 2
critperms-n4routine2026-08-23
Negative control: too-large and too-small values straddling every count
critperms-09known2026-08-28
A cover swaps an inversion, and a free-fall inversion is a cover
critperms-10known2026-08-28
The parabolic criterion sᵢ <= tau iff tau(0..i)!= 0..i, and levels 0 and 1 of the ideal without a table
critperms-11routine2026-08-28
First-degree criticality decided from tau alone: the counts at n = 6, 7, 8 with no ideal and no table
critperms-12candidate2026-08-28
n = 9: 329,513 permutations of S₉ are critical of degree 1
critperms-n5routine2026-08-28
Negative and positive controls for the parabolic criterion
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Source: arXiv:2607.19112v1, Daiva Pucinskaite, *Permutations with Verma Multiplicities [M(p):L(q)] ≥ 2* (21 Jul 2026, math.CO / math.RT), read from the paper's own LaTeX (Vermaₘulₛlₙ.tex, fetched from arxiv.org/e-print/2607.19112).
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7