On groups that have normal forms computable in logspace

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also certain free products, and includes the solvable Baumslag-Solitar groups, as well as non-residually finite (and hence non-linear) examples. We define a group to be logspace embeddable if it embeds in a group with normal forms computable in logspace. We prove that finitely generated nilpotent groups are logspace embeddable. It follows that all groups of polynomial growth are logspace embeddable.

💡 Research Summary

The paper introduces and studies the class of finitely generated groups for which a unique normal form can be computed by a deterministic log‑space algorithm. A normal form is a canonical word that represents each group element uniquely; the requirement is that, given any word over the generating set, a log‑space transducer can output the corresponding normal form. This notion is stronger than merely having a word problem solvable in log‑space, because it demands an explicit, efficiently computable canonical representation.

The authors first formalize the definition and then prove a series of closure properties. They show that if a group G admits log‑space normal forms, then any finite‑index subgroup H of G also admits such normal forms, and conversely any finite extension of H inherits the property. The proof relies on representing coset representatives with a finite automaton and interleaving the coset information with the normal‑form conversion for G, all within logarithmic memory.

Direct products are handled by a straightforward parallelization: given log‑space normal‑form transducers for G and for H, an input word over the product alphabet can be split into its G‑part and H‑part, each processed independently, and the results concatenated. The combined procedure still uses O(log n) space because the two sub‑computations can share the same work tape.

For wreath products G ≀ ℤ, the authors exploit the natural decomposition of a word into a “base” component (an element of the direct sum of copies of G indexed by ℤ) and a “top” component (the ℤ‑coordinate). The ℤ‑coordinate can be tracked by a logarithmic counter, while each base component is processed by the log‑space normal‑form transducer for G. The interaction between the two layers is limited to the well‑known shift action, which can be simulated without exceeding log‑space.

A more delicate result concerns certain free products. When the free factors each have log‑space normal forms and the normal form of the free product can be described as a concatenation of the normal forms of the factors after applying the free‑product reduction rules, the whole free product also enjoys the property. This requires that the reduction process (cancellation of adjacent letters from the same factor) be realizable in log‑space, which holds for a broad but not universal class of free products.

The paper then presents explicit constructions for the solvable Baumslag–Solitar groups BS(1,n) with n≥2. Although these groups are not residually finite and therefore not linear, the authors show that their defining relation t⁻¹ a t = aⁿ allows a log‑space algorithm to keep track of the exponent of a using a binary counter while processing the t‑letters. The resulting normal form is a word a^k t^ℓ with k expressed in binary; both k and ℓ can be computed with O(log n) space, establishing that BS(1,n) belongs to the class.

A central concept introduced is “log‑space embeddable”: a group H is log‑space embeddable if it embeds into some group G that has log‑space normal forms. The authors prove that every finitely generated nilpotent group is log‑space embeddable. The argument proceeds by using the lower central series: each successive quotient is a finitely generated abelian group ℤ^k, which trivially has log‑space normal forms. By inductively applying central extensions—each of which can be simulated in log‑space—the whole nilpotent group embeds into a suitable iterated wreath product of ℤ^k’s, which itself has log‑space normal forms. Consequently, all groups of polynomial growth (by Gromov’s theorem, precisely the virtually nilpotent groups) are log‑space embeddable.

The authors discuss the significance of these results. The class of log‑space normal‑form groups strictly contains the class of automatic groups, yet remains well‑behaved under many standard constructions. It also includes groups that are far from being linear, showing that low‑space computability of normal forms does not force strong algebraic restrictions such as residual finiteness. Moreover, the closure under wreath products and finite extensions suggests that many algorithmic problems (e.g., conjugacy, membership) that are reducible to normal‑form computation may be tackled in log‑space for a wide variety of groups.

In conclusion, the paper establishes a robust framework for studying groups from a log‑space computational perspective, proves extensive closure properties, provides concrete non‑trivial examples (Baumslag–Solitar, nilpotent, virtually nilpotent groups), and opens the door to further exploration of low‑memory algorithms in combinatorial and geometric group theory.