Grooving in the shadows: a search for Stealth and R-Parity violating supersymmetry in CMS data using the ABCDisCoTEC method
2025-01
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Grooving in the shadows: a search for Stealth and R-Parity violating supersymmetry in CMS data using the ABCDisCoTEC method
Alternative title
Authors
Published Date
2025-01
Publisher
Type
Thesis or Dissertation
Abstract
A search for Stealth and R-Parity violating supersymmetry in final states with many jets and little to no missing transverse momentum is presented. This search uses a novel, neural-network-based technique for data-driven background estimation known as the ABCDisCoTEC approach. Events are classified using two independent neural network discriminators that are used to carry out a side-band extrapolation. No significant excess of events is observed for either the Stealth or R-Parity violating signal models. Upper limits are placed on the mass of the top squark at 700 GeV and 930 GeV for the R-Parity violating and Stealth supersymmetry models, respectively.
Keywords
Description
University of Minnesota Ph.D. dissertation. Janaury 2025. Major: Physics. Advisor: Nadja Strobbe. 1 computer file (PDF); xii, 158 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Crossman, Bryan. (2025). Grooving in the shadows: a search for Stealth and R-Parity violating supersymmetry in CMS data using the ABCDisCoTEC method. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/271379.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.