Related papers: Centralizers and conjugacy classes in finite class…

Let $H$ be an extension of a finite group $Q$ by a finite group $G$. Inspired by the results of duality theorems for \'etale gerbes on orbifolds, we describe the number of conjugacy classes of $H$ that maps to the same conjugacy class of…

We reduce the classification of finite subgroups in compact Lie groups to that of quasi-simple ones, prove the number of conjugacy classes is finite and each cojugacy class is Zariski closed in mapping space, and classify "strongly…

Motivated by analogous results for the symmetric group and compact Lie groups, we study the distribution of the number of fixed vectors of a random element of a finite classical group. We determine the limiting moments of these…

In this paper we establish results that will be required for the study of the algebraic geometry of partially-commutative groups. We define classes of groups axiomatised by sentences determined by a graph. Among the classes which arise this…

We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…

We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

We describe the centralizer of irreducible representations from a finitely generated group $\Gamma$ to $PSL(p,\mathbb{C})$ where $p$ is a prime number. This leads to a description of the singular locus (the set of conjugacy classes of…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…

For a CSA group $G$ and a wide class of abelian groups $A$ we give an explicit construction for the tensor $A$-completion of $G$ using free products with amalgamations. We apply the obtained results to the study of basic properties of…

Given a group $G$ we write $h(G)$ to denote the maximum number of times that a field extension of $\mathbb{Q}$ appears as the field of values of a conjugacy class of a group. In this work, we prove that $|G|$ is bounded in terms of $h(G)$.…

The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

We characterize the double centralizer of all parabolic subgroups of the braid groups. We apply this result to provide a new and potentially more efficient solution to the subgroup conjugacy problem for parabolic subgroups. In the course of…

We formalize the concept of a centralizer-respecting homomorphism, surjective homomorphisms which are equivariant with respect to taking the centralizer of a subgroup. There is a functor from the category of centralizer-respecting…

We accomplish the quantization of a few classical constrained systems \`a la (modified) Faddeev-Jackiw formalism. We analyze the constraint structure and obtain basic brackets of the theory. In addition, we disclose the gauge symmetries…

We consider a finiteness condition on centralizers in a group G, namely that |C_G (x) : <x>| is finite for every non-normal cyclic subgroup <x> of G. For periodic groups, this is the same as |C_G (x)| is finite for every non-normal cyclic…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…