Related papers: Growth of groups with incompressible elements, I

Iterated monodromy groups of postcritically-finite rational maps form a rich class of self-similar groups with interesting properties. There are examples of such groups that have intermediate growth, as well as examples that have…

In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…

We study the algebras generated by restriction and induction operations on complex modules over dihedral groups. In the case where the orders of all dihedral groups involved are not divisible by four, we describe the relations, a basis, the…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

We classify the automorphic representations (over number fields) and the irreducible admissible representations (over local fields) of unitary groups which are not quasi-split, under the assumption that the same is known for quasi-split…

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in…

We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…

This paper completely determines the non-amenability of the mapping class groups of infinite-type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non-amenable stabiliser of a point…

We prove that non-elementary hyperbolic groups grow exponentially more quickly than their infinite index quasiconvex subgroups. The proof uses the classical tools of automatic structures and Perron-Frobenius theory. We also extend the main…

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

Explainable machine learning methods have been accompanied by substantial development. Despite their success, the existing approaches focus more on the general framework with no prior domain expertise. High-stakes financial sectors have…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

We analyze definably compact groups in o-minimal expansions of ordered groups as a combination of semi-linear groups and groups definable in o-minimal expansions of real closed fields. The analysis involves structure theorems about their…