SearcharxivSearch

arXiv · 2608.28045

Solvability of unimodular equations in groups and Lie algebras

Abstract

Our results implies, in particular, that a finitely generated solvable group $G$ is nilpotent if and only if it contains a solution to any unimodular equation, i.e., an equation of the form $\prod g_ix^{n_i}=1$, where $g_i\in G$ and $\sum n_i=\pm1$. A similar fact turns out to be true for Lie algebras. We also exhibit an example of a unimodular equation $w(x)=g$ over a finitely generated group $G$, which has a solution (in $G$) for any $g\in G$, but the solution is not unique for some $g\in G$. We show that, for nilpotent groups $G$, the set of unimodular mappings $G^n\to G^n$ (which are defined naturally) forms a group under the composition.

Explore related subjects

Keep this discovery

BibTeXRIS

Anton A. Klyachko, Mikhail A. Mikheenko, Alexander Yu. Olshanskii. 2026-08-28. Solvability of unimodular equations in groups and Lie algebras. https://arxiv.org/abs/2608.28045

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR