Related papers: Average order in wreath products

We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.

We calculate the precise number of r-regular elements in the finite exceptional groups. As a corollary we find that the proportion of r-regular elements is at least 3577/18432 and for all \epsilon>0, there are infinitely finite simple…

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…

In this paper, we showed how a group acting regularly and a diagonal group are embedded into the wreath products in there product action using the Cartesian Decomposition.

We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…

We prove that if a finite group $H$ has a generalized involution model, as defined by Bump and Ginzburg, then the wreath product $H \wr S_n$ also has a generalized involution model. This extends the work of Baddeley concerning involution…

We investigate a semigroup construction generalising the two-sided wreath product. We develop the foundations of this construction and show that for groups it is isomorphic to the usual wreath product. We also show that it gives a slightly…

The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Let $A$ be an abelian group. We consider sufficient conditions for the combinatorial wreath product $A \wr_X B$ to be Hopfian generalising results of Bradford and Fournier-Facio. For an integer $m \geq 2$ we show an example where…

We prove an intermediate value theorem of an arithmetical flavor, involving the consecutive averages of sequences with terms in a given finite set A. For every such set we completely characterize the numbers x ("intermediate values") with…

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this…

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

A non-trivial element of a group is a generalized torsion element if some products of its conjugates is the identity. The minimum number of such conjugates is called a generalized torsion order. We provide several restrictions for…

We study the unit group of the modular group algebra KG, where G is a 2-group of maximal class. We prove that the unit group of KG possesses a section isomorphic to the wreath product of a group of order two with the commutator subgroup of…

Let the group $G = AB$ be the product of the subgroups $A$ and $B$. We determine some structural properties of $G$ when the $p$-elements in $A\cup B$ have prime power indices in $G$, for some prime $p$. More generally, we also consider the…

In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.

We find an upper bound for the number of groups of order $n$ up to isomorphism in the variety $G = A_pA_qA_r$, where $p$, $q$ and $r$ are distinct primes. We also find a bound on the orders and on the number of conjugacy classes of…