On the four-zero texture of quark mass matrices and its stability

We carry out a new study of quark mass matrices $M^{}_{\rm u}$ (up-type) and $M^{}_{\rm d}$ (down-type) which are Hermitian and have four zero entries, and find a new part of the parameter space which was missed in the previous works. We identify two more specific four-zero patterns of $M^{}_{\rm u}$ and $M^{}_{\rm d}$ with fewer free parameters, and present two toy flavor-symmetry models which can help realize such special and interesting quark flavor structures. We also show that the texture zeros of $M^{}_{\rm u}$ and $M^{}_{\rm d}$ are essentially stable against the evolution of energy scales in an analytical way by using the one-loop renormalization-group equations.Comment: 33 pages, 4 figures, minor comments added, version to appear in Nucl. Phys.

A String-inspired Ansatz for Quark Masses and Mixing

We propose a simple but realistic pattern of quark mass matrices at the string scale, which can be derived from orbifold models of superstring theory with no use of gauge symmetries. This pattern is left-right symmetric and preserves the structural parallelism between up and down quark sectors. Its phenomenological consequences on flavor mixing and $CP$ violation are confronted with current experiments at the weak scale by use of the renormalization-group equations in the framework of the minimal supersymmetric standard model. We find that good agreement is achievable without fine-tuning.Comment: Latex 12 pages (including 2 PS figures

Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip (ONoCs). Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is Answer Set Programming (ASP). In this work, we detail the ASP approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic Programming on Finite Domains (CLP(FD)). This paper is under consideration for possible publication on Theory and Practice of Logic Programming.Comment: Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017. 16 pages, LaTeX, 5 figure