scholarly journals A topological zero-one law and elementary equivalence of finitely generated groups

2021 ◽  
Vol 172 (3) ◽  
pp. 102915
Author(s):  
D. Osin
2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Denis Osin

Abstract A finitely generated group 𝐺 is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety U ⁢ V \mathcal{UV} , where 𝒰 (respectively, 𝒱) is a non-abelian (respectively, a non-locally finite) variety, contains a condensed group. In particular, there exist condensed groups of finite exponent. As an application, we obtain some results on the structure of the isomorphism and elementary equivalence relations on the set of finitely generated groups in U ⁢ V \mathcal{UV} .


2020 ◽  
Vol 108 (5-6) ◽  
pp. 671-678
Author(s):  
D. V. Gusev ◽  
I. A. Ivanov-Pogodaev ◽  
A. Ya. Kanel-Belov

2017 ◽  
Vol 20 (4) ◽  
Author(s):  
Anna Giordano Bruno ◽  
Pablo Spiga

AbstractWe study the growth of group endomorphisms, a generalization of the classical notion of growth of finitely generated groups, which is strictly related to algebraic entropy. We prove that the inner automorphisms of a group have the same growth type and the same algebraic entropy as the identity automorphism. Moreover, we show that endomorphisms of locally finite groups cannot have intermediate growth. We also find an example showing that the Addition Theorem for algebraic entropy does not hold for endomorphisms of arbitrary groups.


Author(s):  
J. A. Gerhard

In the paper (4) of Green and Rees it was established that the finiteness of finitely generated semigroups satisfying xr = x is equivalent to the finiteness of finitely generated groups satisfying xr−1 = 1 (Burnside's Problem). A group satisfying x2 = 1 is abelian and if it is generated by n elements, it has at most 2n elements. The free finitely generated semigroups satisfying x3 = x are thus established to be finite, and in fact the connexion with the corresponding problem for groups can be used to give an upper bound on the size of these semigroups. This is a long way from an algorithm for a solution of the word problem however, and providing such an algorithm is the purpose of the present paper. The case x = x3 is of interest since the corresponding result for x = x2 was done by Green and Rees (4) and independently by McLean(6).


Sign in / Sign up

Export Citation Format

Share Document