University of Cambridge > Talks.cam > HEP phenomenology joint Cavendish-DAMTP seminar > Determination of supersymmetric masses using kinematical fits at the LHC

Determination of supersymmetric masses using kinematical fits at the LHC

Add to your list(s) Download to your calendar using vCal

  • UserDr. Christian Sander (Hamburg)
  • ClockThursday 25 February 2010, 16:00-17:00
  • HouseMR13, CMS.

If you have a question about this talk, please contact Kazuki Sakurai.

If physics beyond the Standard Model is discovered at the LHC , the next challenge will be the identification of the underlying theory and the determination of its fundamental parameters. Observables which are sensitive to masses or mass differences are of special interest, and there are various approaches to define them. An overview of possible observables will be given.

In R-parity conserving SUSY models a typical event topology at colliders will be the cascade decay of the two produced SUSY particles. Depending on the SUSY model cascade decays via SUSY particles of equal or similar masses at one particular position in the decay chains might occur with a high abundance. For the kinematics of all events the few masses of the involved SUSY particles are unknowns. The momentum components of the LSPs are also unknown parameters but unique for each event. If the cascades are sufficiently long, e.g. enough mass constraints are available, then the problem can be over constrained by making use of a large number of events. If an efficient selection of these events is possible one can utilize kinematic fits to determine the masses of the involved SUSY particles. In this talk techniques are presented for the solution of this problem. Additionally the problem of the huge combinatorial background is addressed.

This talk is part of the HEP phenomenology joint Cavendish-DAMTP seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity