Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 59 tok/s Pro
GPT-5 Medium 22 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 94 tok/s
GPT OSS 120B 471 tok/s Pro
Kimi K2 212 tok/s Pro
2000 character limit reached

Extending the LHC Reach for New Physics with Sub-Millimeter Displaced Vertices (1702.08613v1)

Published 28 Feb 2017 in hep-ph and hep-ex

Abstract: Particles with a sub-millimeter decay length appear in many models of physics beyond the Standard Model. However, their longevity has been often ignored in their LHC searches and they have been regarded as promptly-decaying particles. In this letter, we show that, by requiring displaced vertices on top of the event selection criteria used in the ordinary search strategies for promptly-decaying particles, we can considerably extend the LHC reach for particles with a decay length of $\gtrsim 100~\mu{\rm m}$. We discuss a way of reconstructing sub-millimeter displaced vertices by exploiting the same technique used for the primary vertex reconstruction on the assumption that the metastable particles are always pair-produced and their decay products contain high-$p_{\rm T}$ jets. We show that, by applying a cut based on displaced vertices on top of standard kinematical cuts for the search of new particles, the LHC reach can be significantly extended if the decay length is $\gtrsim 100~\mu{\rm m}$. In addition, we may measure the lifetime of the target particle through the reconstruction of displaced vertices, which plays an important role in understanding the new physics behind the metastable particles.

Citations (13)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.