Related papers: Average order in wreath products

Let $p$ be a fixed prime. We estimate the number of elements of a set $A \subseteq \mathbb{F}^*_p$ for which $$ s_1s_2 \equiv a \pmod{p} \quad \mbox{for some}\quad a \in [-X,X] \quad \mbox{for all}\quad s_1,s_2 \in A. $$ We also consider…

In the 1980's K.S. Brown proved that the Houghton group $H_n$ is of type $\operatorname{F}_{n-1}$ but not $\operatorname{FP}_n$. We show that, provided $n\ge3$, the same conclusion holds for all subgroups $G$ of $H_n$ that are 'large' in…

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

An $\mathcal{F}$-essential subgroup is called a pearl if it is either elementary abelian of order $p^2$ or non-abelian of order $p^3$. In this paper we start the investigation of fusion systems containing pearls: we determine a bound for…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of…

We examine a number of *-ring orderings, generalizing classical properties of *-positive elements to *-accretives. We also examine *-rings satisfying versions of Blackadar's property (SP), generalizing some basic properties of Rickart…

In the present work, we continue the research initiated in the preprint: V. G. Bardakov, A. L. Iskra, Orders of products of horizontal class transpositions, arXiv:2409.13341, and related to S. Kohl's question on the orders of products of…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

We give a new proof for the Littlewood-Richardson rule for the wreath product $F \wr S_{n}$ where $F$ is a finite group. Our proof does not use symmetric functions but more elementary representation theoretic tools. We also derive a…

In this paper, we introduce a new function computing the harmonic mean of element orders of a finite group. We present a series of properties for this function, and then we study groups for which the value of the function is an integer.

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…

The Hopf order of an element $h$ of a Hopf algebra $H$ is the least $n$ such that the $n$-th Hopf power of $h$ is trivial. For some bismash product Hopf algebras obtained from factorizable groups (including Drinfeld doubles of some groups)…

We study the Hopf property for wreath products of finitely generated groups, focusing on the case of an abelian base group. Our main result establishes a strong connection between this problem and Kaplansky's stable finiteness conjecture.…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

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$…

Let M=M(n,q) be the average of the orders of the elements in the finite unitary group U(n,q). The asymptotic estimate log(M)=nlog(q)-log(n) +o(log n) is proved.