CONGRUENCE CLASSES OF PRESENTATIONS FOR THE COMPLEX REFLECTION GROUPS G(m, p, n)
نویسنده
چکیده
We give an explicit description in terms of rooted graphs for representatives of all the congruence classes of presentations (or r.c.p. for brevity) for the imprimitive complex reflection group G(m, p, n). Also, we show that (S, PS) forms a presentation of G(m, p, n), where S is any generating reflection set of G(m, p, n) of minimally possible cardinality and PS is the set of all the basic relations on S.
منابع مشابه
CONGRUENCE CLASSES OF PRESENTATIONS FOR THE COMPLEX REFLECTION GROUPS G(m, 1, n) AND G(m,m, n)
In the present paper, we give a graph-theoretic description for representatives of all the congruence classes of presentations (or r.c.p. for brevity) for the imprimitive complex reflection groups G(m, 1, n) and G(m, m, n). We have three main results. The first main result is to establish a bijection between the set of all the congruence classes of presentations for the group G(m, 1, n) and the...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007