Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01st74ct509
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Olsen, James D | |
dc.contributor.author | Kimmel, Benjamin | |
dc.date.accessioned | 2020-10-02T20:22:18Z | - |
dc.date.available | 2020-10-02T20:22:18Z | - |
dc.date.created | 2020-05-03 | |
dc.date.issued | 2020-10-02 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01st74ct509 | - |
dc.description.abstract | The scope of this senior thesis covers searching for lepton flavor violations in the Large Hadron Collider. Using data collected from the Compact Muon Solenoid program at the European Organization for Nuclear Research (CERN), I analyze data of the tri-muon decay of the tau, which is a very highly suppressed process in the current Standard Model of particle physics. Constructing muon selection algorithms to efficiently and accurately deter mine the signature of this lepton flavor violating decay process will allow for a better framework of this process. This framework may be used to test the decay process within different modified models of physics, within which the tri-muon decay of the tau may proceed with some measurable rate. This data search and analysis will be adding onto and updating past studies by using the more modern 13 TeV data and Monte Carlo simulation techniques. | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | Searching for Lepton Flavor Violations in the Large Hadron Collider | |
dc.type | Princeton University Senior Theses | |
pu.date.classyear | 2020 | |
pu.department | Physics | |
pu.pdf.coverpage | SeniorThesisCoverPage | |
pu.contributor.authorid | 961240642 | |
pu.certificate | Applications of Computing Program | |
Appears in Collections: | Physics, 1936-2020 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
KIMMEL-BENJAMIN-THESIS.pdf | 4.03 MB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.