Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving the strong CP problem without axions (2406.01689v2)

Published 3 Jun 2024 in hep-ph and hep-th

Abstract: We formulate general conditions under which the strong CP problem is solved by spontaneous CP violation. Quark-mass matrix elements are polynomials in the CP-breaking order parameters, engineered such that their determinant is a real constant. This scheme permits only a limited number of textures. These conditions can be realized in supersymmetric theories with CP as an anomaly-free local flavour symmetry, suggesting a unified solution to the strong CP problem and the flavour puzzle. Our solution can be implemented using either modular invariance or a local U(1) symmetry. We present modular-invariant realizations where matter fields are assigned small modular weights $\pm2$ ($\pm1$), utilising higher levels $N=2$ ($N=3$). Heavy quarks are in general not required, but their presence allows for models where colored particles fill non-singlet representations of the flavour group.

Citations (6)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com