相关论文: Spinning switches on a wreath product
A result of Farahat and Higman shows that there is a ``universal'' algebra, $\mathrm{FH}$, interpolating the centres of symmetric group algebras, $Z(\mathbb{Z}S_n)$. We explain that this algebra is isomorphic to $\mathcal{R} \otimes…
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…
Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a…
In the note some construction of Lie algebras is introduced. It is proved that the construction has the same property as a well known wreath product of groups [1]: Any extension of groups can be embedded into their wreath product [2].
Segerman's 15+4 puzzle is a hinged version of the classic 15-puzzle, in which the tiles rotate as they slide around. In 1974, Wilson classified the groups of solutions to sliding block puzzles. We generalize Wilson's result to puzzles like…
We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…
Generalizing results of Higman and Houghton on varieties generated by wreath products of finite cycles, we prove that the (direct or cartesian) wreath product of arbitrary abelian groups $A$ and $B$ generates the product variety $var (A)…
In this paper we study the complexity of solving orientable quadratic equations in wreath products $A\wr B$ of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given…
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.
Generalizing the centralizer construction of Molev and Olshanski on symmetric groups, we study the structures of the centralizer $\mZ_{m,n}$ of the wreath product $G_{n-m}$ in the group algebra of $G_n$ for any $n\geq m$. We establish the…
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…
In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the…
We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…
In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…
We classify certain cases when the wreath products of distinct pairs of groups generate the same variety. This allows us to investigate the subvarieties of some nilpotent-by-abelian product varieties ${\mathfrak U}{\mathfrak V}$ with the…
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 review various strikingly parallel algebraic structures behind Hilbert schemes of points on surfaces and certain finite groups called the wreath products. We explain connections among Hilbert schemes, wreath products,…
For any nontrivial abelian group $\mathbb{X}$ we construct a reversible (bireversible in case the order of $\mathbb{X}$ is odd) automaton such that its set of states and alphabet are identified with $\mathbb{X}$, transition and output…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
In this article we develop a notion of soficity for actions of countable groups on sets. We show two equivalent perspectives, several natural properties and examples. Notable examples include arbitrary actions of both amenable groups and…