scholarly journals Informationally Complete Characters for Quark and Lepton Mixings

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1000 ◽  
Author(s):  
Michel Planat ◽  
Raymond Aschheim ◽  
Marcelo M. Amaral ◽  
Klee Irwin

A popular account of the mixing patterns for the three generations of quarks and leptons is through the characters κ of a finite group G. Here, we introduce a d-dimensional Hilbert space with d = c c ( G ) , the number of conjugacy classes of G. Groups under consideration should follow two rules, (a) the character table contains both two- and three-dimensional representations with at least one of them faithful and (b) there are minimal informationally complete measurements under the action of a d-dimensional Pauli group over the characters of these representations. Groups with small d that satisfy these rules coincide in a large part with viable ones derived so far for reproducing simultaneously the CKM (quark) and PNMS (lepton) mixing matrices.

2009 ◽  
Vol 74 (1) ◽  
pp. 45-52 ◽  
Author(s):  
Reza Darafsheh ◽  
Ali Moghani

Maturated and unmaturated groups were introduced by the Japanese chemist Shinsaku Fujita, who used them in the markaracter table and the Q-conjugacy character table of a finite group. He then applied his results in this area of research to enumerate isomers of molecules. Using the non-rigid group theory, it was shown by the second author that the full non-rigid (f-NRG) group of 2,3- -dimethylbutane is isomorphic to the group (Z3?Z3?Z3?Z3):Z2 of order 162 with 54 conjugacy classes. Here (Z3?Z3?Z3?Z3):Z2 denotes the semi direct product of four copies of Z3 by Z2, where Zn is a cyclic group of order n. In this paper, it is shown with the GAP program that this group has 30 dominant classes (similarly, Q-conjugacy characters) and that 24 of them are unmatured (similarly, Q-conjugacy characters such that they are the sum of two irreducible characters). Then, the Q-conjugacy character table of the unmatured full non-rigid group 2,3-dimethylbutane is derived.


2000 ◽  
Vol 62 (3) ◽  
pp. 525-528
Author(s):  
Gabriel Navarro

Let G be a finite group and let p be a prime number. We consider the Submatrix of the character table of G whose rows are indexed by the characters in blocks of maximal defect, and whose columns are indexed by the conjugacy classes of P′-size. We prove that this matrix has maximum rank.


Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .


1985 ◽  
Vol 37 (3) ◽  
pp. 442-451 ◽  
Author(s):  
David Gluck

Much information about a finite group is encoded in its character table. Indeed even a small portion of the character table may reveal significant information about the group. By a famous theorem of Jordan, knowing the degree of one faithful irreducible character of a finite group gives an upper bound for the index of its largest normal abelian subgroup.Here we consider b(G), the largest irreducible character degree of the group G. A simple application of Frobenius reciprocity shows that b(G) ≧ |G:A| for any abelian subgroup A of G. In light of this fact and Jordan's theorem, one might seek to bound the index of the largest abelian subgroup of G from above by a function of b(G). If is G is nilpotent, a result of Isaacs and Passman (see [7, Theorem 12.26]) shows that G has an abelian subgroup of index at most b(G)4.


1993 ◽  
Vol 160 (2) ◽  
pp. 441-460 ◽  
Author(s):  
L.G. Kovacs ◽  
G.R. Robinson

2015 ◽  
Vol 74 (1) ◽  
Author(s):  
M. Jahandideh ◽  
M. R. Darafsheh ◽  
N. H. Sarmin ◽  
S. M. S. Omer

Abstract - Let G􀡳 be a non- abelian finite group. The non-commuting graph ,􀪡is defined as a graph with a vertex set􀡳 − G-Z(G)􀢆in which two vertices x􀢞 and y􀢟 are joined if and only if xy􀢞􀢟 ≠ yx􀢟􀢞.  In this paper, we invest some results on the number of edges set , the degree of avertex of non-commuting graph and the number of conjugacy classes of a finite group. In order that if 􀪡􀡳non-commuting graph of H ≅ non - commuting graph of G􀪡􀡴,H 􀡴 is afinite group, then |G􀡳| = |H􀡴| .


1988 ◽  
Vol 64 (1) ◽  
pp. 87-127 ◽  
Author(s):  
Antonio Vera-López ◽  
MA Concepción Larrea

1979 ◽  
Vol 20 (1) ◽  
pp. 57-70 ◽  
Author(s):  
J.R. McMullen ◽  
J.F. Price

A duality theory for finite abelian hypergroups over fairly general fields is presented, which extends the classical duality for finite abelian groups. In this precise sense the set of conjugacy classes and the set of characters of a finite group are dual as hypergroups.


2013 ◽  
Vol 12 (05) ◽  
pp. 1250204
Author(s):  
AMIN SAEIDI ◽  
SEIRAN ZANDI

Let G be a finite group and let N be a normal subgroup of G. Assume that N is the union of ξ(N) distinct conjugacy classes of G. In this paper, we classify solvable groups G in which the set [Formula: see text] has at most three elements. We also compute the set [Formula: see text] in most cases.


Sign in / Sign up

Export Citation Format

Share Document