APA

Anderson, L. (2007). An algorithmic approach to heterotic compactification. Perimeter Institute. https://pirsa.org/07090004

MLA

Anderson, Lara. An algorithmic approach to heterotic compactification. Perimeter Institute, Sep. 04, 2007, https://pirsa.org/07090004

BibTex

@misc{ pirsa_PIRSA:07090004,
  doi = {10.48660/07090004},
  url = {https://pirsa.org/07090004},
  author = {Anderson, Lara},
  keywords = {Quantum Fields and Strings},
  language = {en},
  title = {An algorithmic approach to heterotic compactification},
  publisher = {Perimeter Institute},
  year = {2007},
  month = {sep},
  note = {PIRSA:07090004 see, \url{https://pirsa.org}}
}
            

Abstract

In this talk, I will describe recent work in string phenomenology from the perspective of computational algebraic geometry. I will begin by reviewing some of the long-standing issues in heterotic model building and the goal of producing realistic particle physics from string theory. This goal can be approached by creating a large class of heterotic models which can be algorithmically scanned for physical suitability. I will outline a well-defined set of heterotic compactifications over complete intersection Calabi-Yau manifolds using the monad construction of vector bundles. Further, I will describe how a combination of analytic methods and computer algebra can provide efficient techniques for proving stability and calculating particle spectra.