Related papers: Instability of nondiscrete free subgroups in Lie g…

We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…

This paper is a continuation of the study on maximal and Frattini L-subgroups of an L-group. The normality of the maximal L-subgroups of a nilpotent L-group is explored. Then, the concept of finitely generated L-subgroup is introduced and…

In this paper, we consider the problem of noiseless non-adaptive probabilistic group testing, in which the goal is high-probability recovery of the defective set. We show that in the case of $n$ items among which $k$ are defective, the…

We examine Hilbert-Schmidt stability (HS-stability) of discrete amenable groups from several angles. We give a short, elementary proof that finitely generated nilpotent groups are HS-stable. We investigate the permanence of HS-stability…

A subgroup $H$ of a free group $F$ is called inert in $F$ if for every $G < F$ the rank of the intersection of $H$ with $G$ is no grater than the rank of $G$. In this paper we expand the known families of inert subgroups. We show that the…

It was conjectured in [KLS14] that for arithmetic groups, Invariable Generation is equivalent to the Congruence Subgroup Property. In view of the famous Serre conjecture this would imply that higher rank arithmetic groups are invariably…

We investigate rates of decay for $C_0$-semigroups on Hilbert spaces under assumptions on the resolvent growth of the semigroup generator. Our main results show that one obtains the best possible estimate on the rate of decay, that is to…

We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

We prove that a subgroup of a finitely generated free nilpotent group F is undistorted if and only if it is a retract of a subgroup of finite index in F.

Based on the convergence of their infinitesimal generators in the mixed topology, we provide a stability result for strongly continuous convex monotone semigroups on spaces of continuous functions. In contrast to previous results, we do not…

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

We prove that, if $G$ is a finite almost simple group and $H$ is a maximal subgroup of $G$, then the $10$th term of the derived series of $H$ is perfect. The same is true if $G$ is perfect and $H$ is core-free. The constant $10$ is best…

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…

The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on…

In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph…

We follow in this paper a recent line of work, consisting in characterizing the periodically rigid finitely generated groups, i.e., the groups for which every subshift of finite type which is weakly aperiodic is also strongly aperiodic. In…