Cohomology and the Combinatorics of Words for Magnus Formations
Number Theory
2024-01-04 v2
Abstract
For a prime number and a free pro- group on a totally ordered basis , we consider closed normal subgroups of which are generated by -powers of iterated commutators associated with Lyndon words in the alphabet . We express the profinite cohomology group combinatorically, in terms of the shuffle algebra on . This partly extends existing results for the lower -central and -Zassenhaus filtrations of .
Keywords
Cite
@article{arxiv.2205.11933,
title = {Cohomology and the Combinatorics of Words for Magnus Formations},
author = {Ido Efrat},
journal= {arXiv preprint arXiv:2205.11933},
year = {2024}
}
Comments
Misprints corrected, references added