Related papers: Arbitrarily Large Residual Finiteness Growth

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

The aim of this paper is to compare and contrast the class of residually finite groups with the class of equationally Noetherian groups - groups over which every system of coefficient-free equations is equivalent to a finite subsystem. It…

In this paper we introduce and study the conjugacy ratio of a finitely generated group, which is the limit at infinity of the quotient of the conjugacy and standard growth functions. We conjecture that the conjugacy ratio is $0$ for all…

Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…

This paper aims to introduce a more general definition of quasirandom groups and generalize several well-known results in the literature in this new setting. More precisely, let $G$ be a semi-direct product of groups and $X\subseteq G$, we…

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

We give an alternative proof to the theorem recently proved by Louvaris, Wise and Yehuda, that the growth rates of finitely generated subgroups of $F_r$ are dense in $[1,2r-1]$.

We study growth and complexity of \'etale groupoids in relation to growth of their convolution algebras. As an application, we construct simple finitely generated algebras of arbitrary Gelfand-Kirillov dimension $\ge 2$ and simple finitely…

We construct blocks of finite groups with arbitrarily large Morita Frobenius numbers, an invariant which determines the size of the minimal field of definition of the associated basic algebra. This answers a question of Benson and Kessar.…

In this paper we study the residual solvability of the generalized free product of finitely generated nilpotent groups. We show that these kinds of structures are often residually solvable.

Necessary and sufficient conditions for a group to possess a faithful irreducible representation are investigated

We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime graph.

Groups that can be approximated by finite groups have been the center of much research. This has led to the investigations of the subgroups of metric ultraproducts of finite groups. This paper attempts to study the dual problem: what are…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…

Approximate group analysis technique, that is, the technique combining the methodology of group analysis and theory of small perturbations, is applied to finite-difference equations approximating ordinary differential equations.…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

Let $G$ be a residually finite group. We give an explicit example in the discrete Heisenberg group that the Brown measure of multiplication operators $A \in \mathbb{Z}[G] \subseteq \mathcal{B}(\ell^2(G))$ in general can not be approximated…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.