Related papers: Stable Torsion Length

A famous result of Hall asserts that the multiplication and exponentiation in finitely generated torsion free nilpotent groups can be described by rational polynomials. We describe an algorithm to determine such polynomials for all torsion…

This paper is the 10th in a sequence on the structure of sets of solutions to systems of equations over groups, projections of such sets (Diophantine sets), and the structure of definable sets over few classes of groups. In the 10th paper…

Answering Questions 19.23 and 19.24 from the Kourovka notebook we construct polycyclic groups with arbitrary torsion lengths and give examples of finitely presented groups whose quotients by their torsion subgroups are not finitely…

We give examples of finitely presented groups containing elements with irrational (in fact, transcendental) stable commutator length, thus answering in the negative a question of M. Gromov. Our examples come from 1-dimensional dynamics, and…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

Stochastic Gradient Descent (SGD) stands as a cornerstone optimization algorithm with proven real-world empirical successes but relatively limited theoretical understanding. Recent research has illuminated a key factor contributing to its…

We construct examples of groups showing that virtual solvability and the property of being virtually torsion-free are not preserved by bi-Lipschitz maps and hence by quasi-isometries.

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

A group element is called generalized torsion if a finite product of its conjugates is equal to the identity. We show that in a finitely generated abelian-by-finite group, an element is generalized torsion if and only if its image in the…

Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

A well-known combinatorial algorithm can decide generic rigidity in the plane by determining if the graph is of Pollaczek-Geiringer-Laman type. Methods from matroid theory have been used to prove other interesting results, again under the…

A new measure to characterize stability of complex dynamical systems against large perturbation is suggested, the stability threshold (ST). It quantifies the magnitude of the weakest perturbation capable to disrupt the system and switch it…

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a…

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…