Related papers: Centralizers and conjugacy classes in finite class…

In this paper, we compute the number of z-classes (conjugacy classes of centralizers of elements) in the symmetric group S_n, when n is greater or equal to 3 and alternating group A_n, when n is greater or equal to 4. It turns out that the…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…

We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched…

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…

In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.

Given a finite group $G$, let $Cent(G)$ denote the set of distinct centralizers of elements of $G$. The group $G$ is called $n$-centralizer if $|Cent(G)|=n$ and primitive $n$-centralizer if $|Cent(G)|=|Cent(\frac{G}{Z(G)})|=n$. In this…

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

We give a precise definition of ``generic-case complexity'' and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have…

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…

In this paper we establish decomposition theorems for derivations of group rings. We provide a topological technique for studying derivations of a group ring $A[G]$ in case $G$ has finite conjugacy classes. As a result, we describe all…

We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…

For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…

If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

Let $\mathbb{C}$ be the field of complex numbers. Let $k$ be natural number with $k \geq 2$ and let $p$ be a rational prime. In this paper we count the number of conjugacy classes of admissible cyclic subgroups of…