Related papers: Testing spherical transitivity in iterated wreath …
The multiplicative group of a global field acts on its adele ring by multiplication. We consider the crossed product algebra of the resulting action on the space of Schwartz functions on the adele ring and compute its Hochschild, cyclic and…
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.
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
We introduce and study a class of random walks on lamplighter groups $H\wr G$, where $H$ is a nontrivial finitely generated group and $G$ is an infinite finitely generated group, called \textbf{stationary random walks}. At each step, the…
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
We describe explicitly the algebraic structure of the Terwilliger algebra of wreath products of cyclic schemes.
Let $\mathbb{G}$ be the quantum automorphism group of a finite dimensional C*-algebra $(B,\psi)$ and $\Gamma$ a discrete group. We want to compute the fusion rules of $\widehat{\Gamma}\wr_* \mathbb{G}$. First of all, we will revise the…
We consider the wreath product of two symmetric groups as a group of blocks permutations and we study its conjugacy classes. We give a polynomiality property for the structure coefficients of the center of the wreath product of symmetric…
The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…
Given sofic approximations for countable, discrete groups $G,H$, we construct a sofic approximation for their wreath product $G\wr H$.
Let $M$ be a closed, connected, orientable topological four-manifold with $H_1(M)$ nontrivial and free abelian, $b_2(M)\ne 0, 2$, and $\chi(M)\ne 0$. We show that if $G$ is a finite group of 2-rank $\le 1$ which admits a homologically…
We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…
We show that the class of amalgamated free products of two free groups over a cyclic subgroup admits amenable, faithful and transitive actions on infinite countable sets. This work generalizes the results on such actions for doubles of free…
We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…
The RP-property of Fel'shtyn and Troitsky is proved for wreath products of finitely generated Abelian groups with the group of integers. Such wreath products become the first known example of finitely generated RP-groups being not almost…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…
We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…
A finite spin system invariant under a symmetry group G is a very illustrative example of the finite group action on a set of mappings f:X->Y. In the case of spin systems X is a set of spin carriers and Y contains 2s+1 z-components -s<=m<=s…
An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…