相关论文: Generation of Iterated Wreath Products Constructed…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for…

We consider the problem of modelling noisy but highly symmetric shapes that can be viewed as hierarchies of whole-part relationships in which higher level objects are composed of transformed collections of lower level objects. To this end,…

Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…

The structure of Terwilliger algebras of wreath products by thin schemes or one-class schemes was studied in [A. Hanaki, K. Kim, Y. Maekawa, Terwilliger algebras of direct and wreath products of association schemes, J. Algebra 343 (2011)…

Let $G$ be a finite group, $A$ a finite abelian group. Each homomorphism $\phi:G\to A\wr S_n$ induces a homomorphism $\bar{\phi}:G\to A$ in a natural way. We show that as $\phi$ is chosen randomly, then the distribution of $\bar{\phi}$ is…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

A generating set for the wreath product $\ZZ_r \wr S_n$ which leads to a nicely behaved weak order is presented, and properties of the resulting order are studied.

We present methods of calculating statistics generating functions over the colored permutation groups, and generalizing known theorems from the symmetric groups to general colored permutations groups.

Based on a study of the 2-category of weak distributive laws, we describe a method of iterating Street's weak wreath product construction. That is, for any 2-category K and for any non-negative integer n, we introduce 2-categories…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Starting with an integral domain $D$ of characteristic $0$, we consider a class of iterated wreath product $W_n$ of $n$ copies of $D$. In order that $W_n$ be transfinite hypercentral, it is necessary to restrict to the case of wreath…

In [BV12] we have proven that, for all hyperbolic groups and for all non-trivial free products $\Gamma$, the left-right wreath product group $G:=(Z/2Z)^{(\Gamma)} \rtimes (\Gamma \times \Gamma)$ is W$^*$-superrigid. In this paper, we extend…

Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…

In this paper we consider groups of the form $G\wr L$, where the set of generators naturally extends the sets of generators of $G$ and $L$, and $L$ admits a Cayley graph that is a tree. We show how one can compute the conjugacy growth…

We study the base sizes of finite quasiprimitive permutation groups of twisted wreath type, which are precisely the finite permutation groups with a unique minimal normal subgroup that is also non-abelian, non-simple and regular. Every…

Given a group $G$ and $n\geq 0$, let $W(G,n)$ be the associated iterated wreath product -- unrestricted when $G$ is infinite -- viewed as a permutation group on $G^n$. We prove that the normalizer of $W(G,n)$ in the symmetric group $S(G^n)$…