PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 23, 20260 citationsOpen Access

Five-vertex localization and exact 2-torsion in raw type-D Coxeter kernels

View Full Paper
SKSana Kamiki

Key Points

  • To determine the complete integral first homology and characterize the 2-torsion structure of raw full-reflection covers for type-D Coxeter groups across all ranks n ≥ 5.
  • Separated an integral localization theorem from modular counting using fork defect saturation via R₁ fork relation orbits.
  • Employed finite exact D₅ rewrite certificates combined with symbolic normal-form induction across all ranks n.
  • Constructed an explicit all-n crossed cocycle to resolve the universal formal class κ_n.
  • Established the integral first homology decomposition H₁(K_n^raw; Z) ≅ Z^((n−2)(3n² − 2n + 1)/2) ⊕ (Z/2)^(n(n−2)) for all n ≥ 5.
  • Proved that the raw torsion is purely elementary 2-torsion generated entirely by five-coordinate D₅ subsystems modulo local relations.

Abstract

Let D̂ₙʳaw be the full-reflection Coxeter cover of W (Dₙ) with only thepairwise Coxeter-order relations, and let Kₙʳaw = ker (D̂ₙʳaw → W (Dₙ) ). We determine the integral first homology of Kₙʳaw for every n ≥ 5: H₁ (Kₙʳaw; Z) ≅ Z^ ( (n−2) (3n² − 2n + 1) /2) ⊕ (Z/2) ^ (n (n−2) ). The proof separates an integral localization theorem from a modular countingtheorem. First, one label orbit of the standard R₁ fork relation saturates the full forkdefect in first homology; the resulting target is torsion-free, so the rawtorsion is elementary 2-torsion and is generated by five-coordinate D₅subsystems. Second, the torsion is presented by a permutation module on formal R₁ classesmodulo three local relation orbits T, M₀, M₁. A finite exact D₅ rewritecertificate gives an all-rank normal-form induction, while a signed-reflectiondetector leaves one universal formal class κₙ unresolved. An explicit all-ncrossed cocycle evaluates nontrivially on κₙ, proving that no hidden relationremains. The only computer-assisted proof inputs are finite exact D₅ certificates; everypassage from D₅ to arbitrary Dₙ is symbolic. The rational multiplicities are quoted from the companion paper (doi: 10. 5281/zenodo. 21966004) and are not reproved here.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Sana Kamiki (2026) studied this question.

synapsesocial.com/papers/6a8aadb47677a341144460c1https://doi.org/10.5281/zenodo.21966058
Ask AI
Helpful
Bookmark
Share
View Full Paper