相关论文: Finitely generated infinite simple groups of infin…
In this paper, we study the $C$-width of HNN extension of a group via its proper isomorphic subgroups and amalgamated free product of two groups via their proper isomorphic subgroups with respect to conjugation invariant generating set. We…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…
In this paper we determine all finitely generated abelian groups which are varietal capable with respect to the variety of polynilpotent groups. This result is a vast generalization of the famous Baer's result about capability of 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…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
We find necessary and sufficient conditions for the finite separability of finitely generated commutative rings. Namely, we prove that every such ring is a finite extension of its torsion ideal $I_k$ where $k$ is square-free, and $I_k$ is a…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…
These notes are devoted to lattices in products of trees and related topics. They provide an introduction to the construction, by M. Burger and S. Mozes, of examples of such lattices that are simple as abstract groups. Two features of that…
The aim of this paper is to unify the theory of ends of finitely generated groups with that of ends of locally compact, metrizable and connected topological groups. In both theories one proves that, if the number of ends is finite, then it…
The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…
We determine the finite groups whose real irreducible representations have different degrees.
Veech groups uniformize Teichm\"uller geodesic curves in Riemann moduli space. Recently, examples of infinitely generated Veech groups have been given. We show that these can even have infinitely many cusps and infinitely many infinite…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
We provide examples of groups with transcendental spectral radius: We first construct finitely presented examples, using links between decidability of the Word Problem and semi-computability of the spectral radius. This argument extends to…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…