Related papers: Testing spherical transitivity in iterated wreath …

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

We characterise the group property of being with infinite conjugacy classes for wreath products of groups

We study the Hopf property for wreath products of finitely generated groups, focusing on the case of an abelian base group. Our main result establishes a strong connection between this problem and Kaplansky's stable finiteness conjecture.…

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

Interacting fermionic ladders are important platforms to study quantum phases of matter, such as different types of Mott insulators. In particular, the D-Mott and S-Mott states hold pre-formed fermion pairs and become paired-fermion liquids…

Associated to a finite graph $X$ is its quantum automorphism group $G(X)$. We prove a formula of type $G(X*Y)=G(X)*_wG(Y)$, where $*_w$ is a free wreath product. Then we discuss representation theory of free wreath products, with the…

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 propose a new approach for proving safety of infinite state systems. It extends the analyzed system by transitive relations until its diameter D becomes finite, i.e., until constantly many steps suffice to cover all reachable states,…

Let $\mathbb{C}\mathsf{A}_n = \mathbb{C}[S_2\wr S_2 \wr\cdots \wr S_2]$ be the group algebra of $n$-step iterated wreath product. We prove some structural properties of $\mathsf{A}_n$ such as their centers, centralizers, right and double…

We define and study a notion of free wreath product with amalgamation for compact quantum groups. These objects were already introduced in the case of duals of discrete groups under the name "free wreath products of pairs" in a previous…

Let $G$ be a semisimple algebraic group whose decomposition into a product of simple components does not contain simple groups of type $A$, and $P\subseteq G$ be a parabolic subgroup. Extending the results of Popov [7], we enumerate all…

We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy…

Braided tensor products have been introduced by the author as a systematic way of making two quantum-group-covariant systems interact in a covariant way, and used in the theory of braided groups. Here we study infinite braided tensor…

We classify $\mathcal{R}$- and $\mathcal{L}$-cross-sections of wreath products of finite inverse symmetric semigroups $\mathcal{IS}_m \wr_p \mathcal{IS}_n$ up to isomorphism. We show that every isomorphism of $\mathcal{R}$ ($\mathcal{L}$-)…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

Let $A$ be a nilpotent $p$-group of finite exponent, and $B$ be an abelian $p$-groups of finite exponent. Then the wreath product $A {\rm Wr} B$ generates the variety ${\rm var}(A) {\rm var}(B)$ if and only if the group $B$ contains a…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.