Related papers: The rank gradient from a combinatorial viewpoint

We study model geometries of finitely generated groups. If a finitely generated group does not contain a non-trivial finite rank free abelian commensurated subgroup, we show any model geometry is dominated by either a symmetric space of…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We investigate when discrete, amenable groups have $C^*$-algebras of real rank zero. While it is known that this happens when the group is locally finite, the converse in an open problem. We show that if $C^*(G)$ has real rank zero, then…

We construct elementary subgroups of all reductive groups of the local isotropic rank $\geq 2$ over rings and prove their basic properties. In particular, our results may be applied to the automorphism groups of any finitely generated…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

We prove that for a finitely generated linear group G over a field of positive characteristic the family of quotients by finite subgroups has finite asymptotic dimension. We use this to show that the K-theoretic assembly map for the family…

Landau's theorem on conjugacy classes asserts that there are only finitely many finite groups, up to isomorphism, with exactly $k$ conjugacy classes for any positive integer $k$. We show that, for any positive integers $n$ and $s$, there…

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

We study the class of densely related groups. These are finitely generated (or more generally, compactly generated locally compact) groups satisfying a strong negation of being finitely presented, in the sense that new relations appear at…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We extend the classical Baire category approach, used in proving the finite generator theorem of Krieger, the homomorphism theorem of Sinai and the isomorphism theorem of Ornstein, applying a similar reasoning to the case of actions of…

The paper is intended to be a survey on some topics within the framework of automorphisms of a relatively free groups of infinite rank. We discuss such properties as tameness, primitivity, small index, Bergman property, and so on.

We consider the natural Lie algebra structure on the (associative) group algebra of a finite group $G$, and show that the Lie subalgebras associated to natural involutive antiautomorphisms of this group algebra are reductive ones. We give a…

In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Multi-group agnostic learning is a formal learning criterion that is concerned with the conditional risks of predictors within subgroups of a population. The criterion addresses recent practical concerns such as subgroup fairness and hidden…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…