Pinning down the leptophobic $Z^\prime$ in leptonic final states with Deep Learning
Tanumoy Mandal, Aniket Masaye, Subhadip Mitra, Cyrin Neeraj, Naveen, Reule, Kalp Shah

TL;DR
This paper employs Deep Learning to analyze leptophobic $Z'$ bosons and right-handed neutrinos at the LHC, identifying parameter regions accessible via monolepton final states beyond traditional dijet searches.
Contribution
It introduces a Deep Learning approach to detect leptophobic $Z'$ and right-handed neutrinos in monolepton channels, extending search capabilities at the HL-LHC.
Findings
Deep Learning enhances detection sensitivity for $Z'$ in monolepton channels.
Parameter regions inaccessible to dijet searches can be probed.
Analysis covers six GUT embeddings and a GS benchmark.
Abstract
A leptophobic that does not couple with the Standard Model leptons can evade the stringent bounds from the dilepton-resonance searches. In our earlier paper [T. Arun et al., Search for the boson decaying to a right-handed neutrino pair in leptophobic models, Phys. Rev. D, 106 (2022) 095035; arXiv:2204.02949], we presented two gauge anomaly-free models -- one based on the Green-Schwarz (GS) anomaly cancellation mechanism, and the other on a grand unified theory (GUT) framework with gauge kinetic mixing -- where a heavy leptophobic is present along with right-handed neutrinos (). We pointed out the interesting possibility of a correlated search for and at the LHC through the channel. This channel can probe a part of the parameter space beyond the reach of the standard dijet resonance searches. In this follow-up…
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
