Computational Challenges in Calabi-Yau and String Phenomenology

Mon, 30/11/2009
12:00
Maximillian Kreuzer (Technische Universitaet Wien) String Theory Seminar Add to calendar L3
I discuss some theorems and algorithms that we use for enumerating reflexive polytopes and related objects, as well as problems and examples that are of interest in both algebraic geometry and string phenomenology. I would also like to exchange ideas about possible synergies between the numerous current computational activities in the field.