Related papers: Conjugacy classes and centralisers in wreath produ…

Using combinatorial properties of complex reflection groups, we show that the generalised Calogero-Moser space associated to the centre of the corresponding rational Cherednik algebra is singular for all values of its deformation parameter…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

Let $G$ be an algebraic group of type $G_2$ over a field $k$ of characteristic $\neq 2,3$. In this paper we calculate centralizers of semisimple elements in anisotropic $G_2$. Using these, we show explicitly that there are six conjugacy…

Let $S(\infty)$ denote the infinite symmetric group formed by the finitary permutations of the set of natural numbers; this is a countable group. We introduce its virtual group algebra, a completion of the conventional group algebra…

For the finite groups GU(3), SU(3), GL(3), SL(3) over a finite field we solve the class product problem, i.e., we give a complete list of $m$-tuples of conjugacy classes whose product does not contain the identity matrix.

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…

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

In this paper, we compute the number of distinct centralizers of some classes of finite rings. We then characterize all finite rings with $n$ distinct centralizers for any positive integer $n \leq 5$. Further we give some connections…

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We introduce a generalization of degenerate affine Hecke algebra, called wreath Hecke algebra, associated to an arbitrary finite group G. The simple modules of the wreath Hecke algebra and of its associated cyclotomic algebras are…

Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…

In this paper we study the action of the fundamental group of a finite metric graph on its universal covering tree. We assume the graph is finite, connected and the degree of each vertex is at least three. Further, we assume an…

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 present two new results on the number of certain conjugacy classes of a finite group. For a finite group $G$, let $n(G)$ be the maximum of $k_{p}(G)$ taken over all primes $p$ where $k_{p}(G)$ denotes the number of…

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…

Weighted simplicial complexes (WSCs) are powerful tools for describing weighted cloud data or networks with weighted nodes. In this paper, we propose a novel approach to study WSCs via the concept of polarization. Polarization of a WSC…

A finite group $G$ is called an F-group if for every $x, y \in G \setminus Z(G)$, $C(x) \leq C(y)$ implies that $C(x) = C(y)$. On the otherhand, two elements of a group are said to be $z$-equivalent or in the same $z$-class if their…