We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide with coefficients in the Magnus expansion. In contrast with Magnus’ coefficients, our invariants are defined on all groups and over any PID. They respect products in the group and are a complete invariant of the dimension series, so they are the coefficients of a universal multiplicative finite-type invariant, depending functorially on the group. Letter-braiding invariants arise from the bar construction on a cochain model of a space with a prescribed fundamental group. This approach specializes to simplicial presentations of a group as well as to more geometric contexts, which we illustrate in examples. As an application, we define variants of the Johnson filtration and the Johnson homomorphism on the automorphisms of arbitrary groups, and use them to constrain automorphisms of finite p-groups.

生成讲解博客的中文版本

生成AI智能校验的中文版本