Complementarity of $\mu$TRISTAN and Belle II in searches for charged-lepton flavour violation
Gabriela Lichtenstein, Michael A. Schmidt, German Valencia, Raymond R., Volkas

TL;DR
This paper explores how the proposed $bbTRISTAN$ collider can complement Belle II in searching for charged-lepton flavor violation, especially in detecting new resonances and setting bounds beyond direct reach.
Contribution
It demonstrates the potential of $bbTRISTAN$ to directly produce and study new mediating resonances for CLFV and compares its sensitivity to Belle II for specific models.
Findings
$bbTRISTAN$ can produce competitive bounds for heavy resonances.
It can uniquely probe models only accessible by $bbTRISTAN$.
Sensitivity analysis for different $k_{1,2,3}$ models shows complementary reach.
Abstract
We analyse the potential of the proposed and collider TRISTAN to complement the searches for charged-lepton flavour-violation (CLFV) that can be carried out by Belle II. TRISTAN offers the possibility of directly producing and studying new resonances that could mediate CLFV for a certain range of masses. In addition, we find that it can produce competitive bounds to those from Belle II for cases where the new resonance lies beyond direct reach. We illustrate these points with three "lepton triality" models, where we also find an example that can only be probed by TRISTAN. These three models feature doubly-charged scalars, denoted respectively, that induce both CLFV and flavour-conserving processes. Tree-level exchange induces the CLFV scattering process , while interactions induce $\mu^+…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParticle physics theoretical and experimental studies · Computational Physics and Python Applications · Dark Matter and Cosmic Phenomena
