Soft superweak CP violation in a 3-3-1 model

We show that it is possible to implement soft superweak CP violation in the context of a 3-3-1 model with only three triplets. All CP violation effects come from the exchange of singly and doubly charged scalars. We consider the implication of this mechanism in the quark and lepton sectors. In particular it is shown that, in this model, as in most of those which incorporate scalar mediated CP violation, it is possible to have large electric dipole moments for the muon and the tau lepton while keeping small those of the electron and neutron. The CKM mixing matrix is real at the tree level but gets a phase at the 1-up loop level. ©1999 The American Physical Society.

Soft supcrweak CP violation in a 3-3-1 model

We show that it is possible to implement soft superweak CP violation in the context of a 3-3-1 model with only three triplets. All CP violation effects come from the exchange of singly and doubly charged scalars. We consider the implication of this mechanism in the quark and lepton sectors. In particular it is shown that, in this model, as in most of those which incorporate scalar mediated CP violation, it is possible to have large electric dioole moments for the muon and the tau lepton while keeping small those of the electron and neutron. The CKM mixing matrix is real at the tree level but gets a phase at the 1-up loop level. ©1999 The American Physical Society.

New CP violation in neutrino oscillations

Measurements of CP-violating observables in neutrino oscillation experiments have been studied in the literature as a way to determine the CP-violating phase in the mixing matrix for leptons. Here we show that such observables also probe new neutrino interactions in the production or detection processes. Genuine CP violation and fake CP violation due to matter effects are sensitive to the imaginary and real parts of new couplings. The dependence of the CP asymmetry on the source-detector distance is different from the standard one and, in particular, enhanced at short distances. We estimate that future neutrino factories will be able to probe in this way new interactions that are up to four orders of magnitude weaker than the weak interactions. We discuss the possible implications for models of new physics. ©2001 The American Physical Society.

Resolvendo o problema dos sabores

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Simetria discreta 'S IND. 3' como uma possível extensão para o Modelo Padrão

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Quasi-Dirac neutrinos and solar neutrino data

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Flavor-changing neutral currents in the minimal 3-3-1 model revisited

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

First measurements of the aSPECT spectrometer

The aSPECT spectrometer has been constructed to measure, with high precision, the integral proton spectrum of the free neutron decay. From this spectrum the neutrino electron angular correlation coefficient a can be inferred. The coefficient a is involved in several Standard Model tests, like the unitarity test of the Cabibbo-Kobayashi-Maskawa quark mixing matrix. aSPECT has been designed to determine the coefficient a with an accuracy better than 3×10−4, that is, one order of magnitude better than the best current accuracy. First measurements with neutron beam with the aSPECT spectrometer were performed in the Forschungsneutronenquelle Heinz Maier-Leibnitz, in Munich. A study of the data taken in this period is presented in this thesis, demonstrating the proof of principle of the spectrometer. However, the observation of situation and time-dependent background instabilities impedes the report of a new value of the coefficient a. A thorough data analysis is carried out to identify sources of these background instabilities in order to improve the aSPECT experiment for future beam times. The investigation indicates that trapped particles are most likely the reason for the background problems. Furthermore, it has been observed that measurements containing less trapped particles provide a-values closer to the currently Particle Data Group value. Based on this findings, different measures are proposed to eliminate potential traps in the spectrometer. Indeed, with the proposed modifications realized for the following beam-times, the observed background instabilities were greatly reduced.

Calculable lepton masses, seesaw relations, and four neutrino mixings in a 3-3-1 model with an extra U(1) symmetry

We propose a scheme in which the masses of the heavier leptons obey seesaw type relations. The light lepton masses, except the electron and the electron neutrino ones, are generated by one loop level radiative corrections. We work in a version of the 3-3-1 electroweak model that predicts singlets (charged and neutral) of heavy leptons beyond the known ones. An extra U(1)(Omega) symmetry is introduced in order to avoid the light leptons getting masses at the tree level. The electron mass induces an explicit symmetry breaking at U(1)(Omega). We discuss also the mixing matrix among four neutrinos. The new energy scale required is not higher than a few TeV.

Search for heavy neutrinos in $D_s$ decays with the CMS detector at LHC

This thesis presents a search for a sterile right-handed neutrino $N$ produced in $D_s$ meson decays, using proton-proton collisions collected by the CMS experiment at the LHC. The data set used for the analysis, the B-Parking data set, corresponds to an integrated luminosity of $41.7\,\textrm{fb}^{-1}$ and was collected during the 2018 data-taking period. The analysis is targeting the $D_s^+\rightarrow N(\rightarrow\mu^{\pm}\pi^{\mp})\mu^{+}$ decays, where the final state muons can have the same electric charge allowing for a lepton flavor violating decay. To separate signal from background, a cut-based analysis is optimized using requirements on the sterile neutrino vertex displacement, muon and pion impact parameter, and impact parameter significance. The expected limit on the active-sterile neutrino mixing matrix parameter $|V_{\mu}|^2$ is extracted by performing a fit of the $\mu\pi$ invariant mass spectrum for two sterile neutrino mass hypotheses, 1.0 and 1.5 GeV. The analysis is currently blinded, following the internal CMS review process. The expected limit ranges between approximately $10^{-4}$ for a 1.0 GeV neutrino to $7\times10^{-5}$ for a 1.5 GeV neutrino. This is competitive with the best existing results from collider experiments over the same mass range.

A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.

Sparse matrix multiplication on a reconfigurable many-core architecture

Sparse matrix-vector multiplication (SMVM) is a fundamental operation in many scientific and engineering applications. In many cases sparse matrices have thousands of rows and columns where most of the entries are zero, while non-zero data is spread over the matrix. This sparsity of data locality reduces the effectiveness of data cache in general-purpose processors quite reducing their performance efficiency when compared to what is achieved with dense matrix multiplication. In this paper, we propose a parallel processing solution for SMVM in a many-core architecture. The architecture is tested with known benchmarks using a ZYNQ-7020 FPGA. The architecture is scalable in the number of core elements and limited only by the available memory bandwidth. It achieves performance efficiencies up to almost 70% and better performances than previous FPGA designs.

A sparse parallel hybrid Monte Carlo algorithm for matrix computations

In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on hybrid Monte Carlo algorithms for matrix inversion and solving systems of linear algebraic equations. This algorithm consists of two parts, approximate inversion by Monte Carlo and iterative refinement using a deterministic method. Here we present a parallel hybrid Monte Carlo algorithm, which uses Monte Carlo to generate an approximate inverse and that improves the accuracy of the inverse with an iterative refinement. The new algorithm is applied efficiently to sparse non-singular matrices. When we are solving a system of linear algebraic equations, Bx = b, the inverse matrix is used to compute the solution vector x = B(-1)b. We present results that show the efficiency of the parallel hybrid Monte Carlo algorithm in the case of sparse matrices.

A W-matrix methodology for solving sparse network equations on multiprocessor computers

This paper describes a methodology for solving efficiently the sparse network equations on multiprocessor computers. The methodology is based on the matrix inverse factors (W-matrix) approach to the direct solution phase of A(x) = b systems. A partitioning scheme of W-matrix , based on the leaf-nodes of the factorization path tree, is proposed. The methodology allows the performance of all the updating operations on vector b in parallel, within each partition, using a row-oriented processing. The approach takes advantage of the processing power of the individual processors. Performance results are presented and discussed.

Sparse matrix inversion,

Mode of access: Internet.