2001
DOI: 10.1142/s0217751x01003196
|View full text |Cite
|
Sign up to set email alerts
|

Parametrizing the Mixing Matrix: A Unified Approach

Abstract: A unified approach to parametrization of the mixing matrix for N generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way to the known phenomenologically useful parametrizations of the mixing matrix.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
25
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(26 citation statements)
references
References 22 publications
1
25
0
Order By: Relevance
“…We thus can easily recover all the existing parameterizations of the CKM matrix [21,[24][25][26][27][28][29]: -the Maiani parameterization [24,27] is obtained from U 1 by setting θ 12 → θ, θ 13 → β, θ 23 → γ, δ 12 → 0, δ 13 → 0, δ 23 → −δ; -the Chau-Keung parameterization [24,28] [24,29] is obtained from U 1 by setting θ 12 ↔ θ 13 , then δ 12 → 0, δ 13 → 0, θ 12 → π + θ 12 , θ 13 → π − θ 13 , θ 23 → 3 2 π + θ 23 , exchanging second and third column and multiplying the last row for (−1). From the above analysis it is clear that a number of new parameterizations of the mixing matrix can be generated and that a clear physical meaning can be attached to each of them, by considering the order in which the generators G ij act and the initial conditions used for getting that particular matrix.…”
Section: The Parameterizations Of the Three Flavor Mixing Matrixmentioning
confidence: 99%
“…We thus can easily recover all the existing parameterizations of the CKM matrix [21,[24][25][26][27][28][29]: -the Maiani parameterization [24,27] is obtained from U 1 by setting θ 12 → θ, θ 13 → β, θ 23 → γ, δ 12 → 0, δ 13 → 0, δ 23 → −δ; -the Chau-Keung parameterization [24,28] [24,29] is obtained from U 1 by setting θ 12 ↔ θ 13 , then δ 12 → 0, δ 13 → 0, θ 12 → π + θ 12 , θ 13 → π − θ 13 , θ 23 → 3 2 π + θ 23 , exchanging second and third column and multiplying the last row for (−1). From the above analysis it is clear that a number of new parameterizations of the mixing matrix can be generated and that a clear physical meaning can be attached to each of them, by considering the order in which the generators G ij act and the initial conditions used for getting that particular matrix.…”
Section: The Parameterizations Of the Three Flavor Mixing Matrixmentioning
confidence: 99%
“…Such 3-subgroups might be used as bigger elementary blocks in constructing of a general transformation [25,28]. For instance, for the variant from (8.5): (α 1 , A 2 , A 3 ) =⇒ (a 1 , X 2 , X 3 ) the general multiplication law (7.4) gives…”
Section: On the Multiplication Law For Gl(4 C) In Dirac Basismentioning
confidence: 99%
“…This paper is a contribution to the Proceedings of the Seventh International Conference "Symmetry in Nonlinear Mathematical Physics" (June [24][25][26][27][28][29][30]2007, Kyiv, Ukraine). The full collection is available at http://www.emis.de/journals/SIGMA/symmetry2007.html…”
Section: Introductionmentioning
confidence: 99%
“…Another kind of factorization is that suggested by Chaturvedi and Mukunda in their paper [6] aiming at obtaining a more "suitable" parametrization of the Kobayashi-Maskawa matrix. Although the proposed forms for n = 3, 4 are awfully complicated by comparison with other parametrizations existing in literature, and for this reason it cannot be extended easily to cases n ≥ 5, the paper contains a novel idea namely that that an SU(n) matrix can be parametrized by a sequence of n − 1 complex vectors of dimensions 2, 3, .…”
Section: −Iϕmentioning
confidence: 99%