相关论文: Spinning switches on a wreath product

We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…

We develop general methods to compute the algebraic $K$-theory of crossed products by Bernoulli shifts on additive categories. From this we obtain a $K$-theory formula for regular group rings associated to wreath products of finite groups…

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection…

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

We present a survey of our recent research on varieties, generated by wreath products of groups. In particular, the full classification of all cases, when the (cartesian or direct) wreath product of any abelian groups $A$ and $B$ generates…

It is known that the notion of a transitive subgroup of a permutation group $P$ extends naturally to the subsets of $P$. We study transitive subsets of the wreath product $G \wr S_n$, where $G$ is a finite abelian group. This includes the…

We define wreath products of cocommutative Hopf algebras, and show that they enjoy a universal property of classifying cleft extensions, analogous to the Kaloujnine-Krasner theorem for groups. We show that the group ring of a wreath product…

In 1997 Clarke et al. studied a $q$-analogue of Euler's difference table for $n!$ using a key bijection $\Psi$ on symmetric groups. In this paper we extend their results to the wreath product of a cyclic group with the symmetric group. In…

Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…

A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…

We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…

In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under…

A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…

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…

We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices…

We obtain an exact formula for the average order of elements of a wreath product of two finite groups. Then focussing our attention on $p$-groups for primes $p$, we give an estimate for the average order of a wreath product $A\wr B$ in…

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

The generalized wreath product of symmetric association schemes was introduced by R.A.Bailey in the European Journal of Combinatorics 27 (2006) 428-435. It is recognized as a unification of both the wreath product and the direct product of…

Mark Haiman has reduced Macdonald positivity conjecture to a statement about geometry of the Hilbert scheme of points on the plane, and formulated a generalization of the conjectures where the symmetric group is replaced by the wreath…