Gravitational waves from the first order electroweak phase transition in the Z3Z_3 symmetric singlet scalar model

Among various scenarios of baryon asymmetry of the Universe, electroweak baryogenesis is directly connected with physics of the Higgs sector. We discuss spectra of gravitational waves which are originated by the strongly first order phase transition at the electroweak symmetry breaking, which is required for a successful scenario of electroweak baryogenesis. In the $Z_3$ symmetric singlet scalar model, the significant gravitational waves are caused by the multi-step phase transition. We show that the model can be tested by measuring the characteristic spectra of the gravitational waves at future interferometers such as LISA and DECIGO.Comment: 5 pages, 9 figures, contribution to the proceedings of Joint Conference of ICGAC-XIII and IK15, Korea, 3--7 July 2017, based on arXiv:1706.09721 [hep-ph

Gauge Symmetry and Neural Networks

We propose a new model of neural network. It consists of spin variables to describe the state of neurons as in the Hopfield model and new gauge variables to describe the state of synapses. The model possesses local gauge symmetry and resembles lattice gauge theory of high-energy physics. Time dependence of synapses describes the process of learning. The mean field theory predicts a new phase corresponding to confinement phase, in which brain loses ablility of learning and memory.Comment: 9 pages, 7 figure

Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes

In this paper, we establish a lemma in algebraic coding theory that frequently appears in the encoding and decoding of, e.g., Reed-Solomon codes, algebraic geometry codes, and affine variety codes. Our lemma corresponds to the non-systematic encoding of affine variety codes, and can be stated by giving a canonical linear map as the composition of an extension through linear feedback shift registers from a Grobner basis and a generalized inverse discrete Fourier transform. We clarify that our lemma yields the error-value estimation in the fast erasure-and-error decoding of a class of dual affine variety codes. Moreover, we show that systematic encoding corresponds to a special case of erasure-only decoding. The lemma enables us to reduce the computational complexity of error-evaluation from O(n^3) using Gaussian elimination to O(qn^2) with some mild conditions on n and q, where n is the code length and q is the finite-field size.Comment: 37 pages, 1 column, 10 figures, 2 tables, resubmitted to IEEE Transactions on Information Theory on Jan. 8, 201