Curriculum vitae: Louis Theran

Picture of Louis
School of Mathematics and Statistics
University of St Andrews
Fife KY16 9SS

Research interests

I'm interested in discrete geometry, combinatorics, machine learning, algorithms, and the interactions between these areas. I work on theoetical and applied problems. (See here for a more detailed description of current projects.)

Education

9.2010: Ph.D., Computer Science, University of Massachusetts, Amherst.
Dissertation: Problems in generic combinatorial rigidity: sparsity, sliders, and emergence of components
Advisor: Ileana Streinu
9.2007: M.S., Computer Science, University of Massachusetts, Amherst.
2.2006: B.S., Computer Science and Mathematics, University of Massachusetts, Amherst.
Honors: cum laude

Academic positions

6.2014–4.2016: Aalto Science Institute Fellow, Aalto University (Helsinki)
Affiliated member of Department of Information and Computer Science
Cofunded by AKA project COALESCE (PI: Petteri Kaski)
9.2011–6.2014: Post-doctoral researcher, Freie Universität Berlin
Supported by the ERC Advance Grant Project SD-Models (PI: Günter M. Ziegler)
7.2009–8.2011: Research Assistant Professor, Temple University (Philadelphia)
Post-doctoral appointment
Supported by NSF CDI-I grant DMR 0835586 (PIs: Igor Rivin and M. M. J. Treacy)
9.2004–6.2009: Research assistant, University of Massachusetts, Amherst
Graduate student appointment
Supervised by Ileana Streinu

Industry positions

2000–2001: Senior Software Engineer, Nokia Research Center (Boston)
1999–2000: Software Engineer, Nokia Research Center (Boston)
1998–1999: Software Engineer, Nokia Wireless Software Solutions (Boston)
1996–1998: Software Engineer, Open Software Foundation Research Institute (Cambridge)

Funding

2014–2017: AScI Thematic Program Challenges in Large Geometric Structures and Big Data
PI and coordinator
2006: NSF/KOSEF East Asia and Pacific Summer Institutes Fellowship (NSF OISE-0611980)
Supported a Summer visit to KAIST

Publications

Journal papers

Affine rigidity and conics at infinity
International Mathematics Research Notices
, 2017.
  • Robert Connelly
  • Steven J. Gortler
  • Louis Theran
Detecting dependencies in geometric constraint systems
Computer Aided Geometric Design
, 2016.
  • James Farre
  • Helena Kleinschmidt
  • Jessica Sidman
  • Audrey Lee-St. John
  • Stephanie Stark
  • Louis Theran
  • Xilin Yu
Anchored boundary conditions for locally isostatic networks
Physical Review E
, 2015.
  • Louis Theran
  • Anthony Nixon
  • Elissa Ross
  • Mahdi Sadjadi
  • Brigitte Servatius
  • Michael Thorpe
Universality theorems for inscribed polytopes and Delaunay triangulations
Discrete & Computational Geometry
, 2015.
  • Karim A. Adiprasito
  • Arnau Padrol
  • Louis Theran
Frameworks with forced symmetry I: reflections and rotations
Discrete & Computational Geometry
, 2015.
  • Justin Malestein
  • Louis Theran
The algebraic combinatorial approach for Low-Rank Matrix Completion
Journal of Machine Learning Research
, 2015.
  • Franz J. Király
  • Louis Theran
  • Ryota Tomioka
Frameworks with forced symmetry II: orientation-preserving crystallographic groups
Geometriae Dedicata
, 2014.
  • Justin Malestein
  • Louis Theran
Generic combinatorial rigidity of periodic frameworks
Advances in Mathematics
, 2013.
  • Justin Malestein
  • Louis Theran
Topological designs
Geometriae Dedicata
, 2013.
  • Justin Malestein
  • Igor Rivin
  • Louis Theran
Natural realizations of sparsity matroids
Ars Mathematica Contemporanea
, 2011.
  • Ileana Streinu
  • Louis Theran
Slider-pinning rigidity: a Maxwell–Laman-type theorem
Discrete & Computational Geometry
, 2010.
  • Ileana Streinu
  • Louis Theran
Sparse hypergraphs and pebble game algorithms
European Journal of Combinatorics
, 2009.
  • Ileana Streinu
  • Louis Theran
Sparsity-certifying graph decompositions
Graphs and Combinatorics
, 2009.
  • Ileana Streinu
  • Louis Theran
Characterizing sparse graphs by map decompositions
Journal of Combinatorial Mathematics and Combinatorial Computing
, 2007.
  • Ruth Haas
  • Audrey Lee
  • Ileana Streinu
  • Louis Theran
Graded sparse graphs and matroids
Journal of Universal Computer Science
, 2007.
  • Audrey Lee
  • Ileana Streinu
  • Louis Theran

Refereed conferences

Delaunay triangulations with disconnected realization spaces
In: Proc. of SoCG
, 2014.
  • Arnau Padrol
  • Louis Theran
Detecting dependencies in geometric constraint systems
In: Proc. of ADG
, 2014.
  • James Farre
  • Helena Kleinschmidt
  • Jessica Sidman
  • Audrey Lee-St. John
  • Stephanie Stark
  • Louis Theran
Generic rigidity with forced symmetry and sparse colored graphs
In: Proc. of Fields Workshop on Rigidity and Symmetry
, 2014.
  • Justin Malestein
  • Louis Theran
Rigid components in fixed-lattice and cone frameworks
In: Proc. of CCCG
, 2011.
  • Matthew Berardi
  • Brent Heeringa
  • Justin Malestein
  • Louis Theran
Searching in tree-like partial orders
In: Proc. of WADS
, 2011.
  • Brent Heeringa
  • Marius Cătălin Iordan
  • Louis Theran
The rigidity transition in random graphs
In: Proc. of SODA
, 2011.
  • Shiva Kasiviswanathan
  • Cristopher Moore
  • Louis Theran
Rigid components of random graphs
In: Proc. of CCCG
, 2009.
  • Louis Theran
Combinatorial genericitity and minimal rigidity
In: Proc. of SoCG
, 2008.
  • Ileana Streinu
  • Louis Theran
Analyzing rigidity with pebble games
In: Proc. of SoCG
, 2008.
  • Audrey Lee
  • Ileana Streinu
  • Louis Theran
The slider-pinning problem
In: Proc. of CCCG
, 2007.
  • Audrey Lee
  • Ileana Streinu
  • Louis Theran
Finding and maintaining rigid components
In: Proc. of CCCG
, 2005.
  • Audrey Lee
  • Ileana Streinu
  • Louis Theran

Preprints

Determining generic point configurations from unlabeled path or loop lengths
Preprint
, 2017.
  • Ioannis Gkioulekas
  • Steven J. Gortler
  • Louis Theran
  • Todd Zickler
Analytic analysis of auxetic metamaterials through analogy with rigid link systems
Preprint
, 2017.
  • Daniel Rayneau-Kirkhope
  • Chengzhao Zhang
  • Louis Theran
  • Marcelo A. Dias
Generic Global and Universal Rigidity
Preprint
, 2016.
  • Robert Connelly
  • Steven J. Gortler
  • Louis Theran
Learning with Cross-Kernels and Ideal PCA
Preprint
, 2014.
  • Franz J. Király
  • Martin Kreuzer
  • Louis Theran
Ultrarigid periodic frameworks
Preprint
, 2014.
  • Justin Malestein
  • Louis Theran
Matroid regression
Preprint
, 2014.
  • Franz J. Király
  • Louis Theran
Dual-to-kernel learning with ideals
Preprint
, 2014.
  • Franz J. Király
  • Martin Kreuzer
  • Louis Theran
Algebraic matroids with graph symmetry
Preprint
, 2013.
  • Franz J. Király
  • Zvi Rosen
  • Louis Theran
Generic rigidity of reflection frameworks
Preprint
, 2012.
  • Justin Malestein
  • Louis Theran
Lines induced by bichromatic point sets
Preprint
, 2011.
  • Louis Theran

Teaching

Courses

S2 2016–2017: Symbolic Computation (MT4111/5611) (15 cr)
University of St Andrews
S1 2016–2017: Introductory Mathematics (MT1001) (20 cr)
University of St Andrews
Fall 2014: Computational geometry (5 cr)
Aalto University, master's course
Spring 2012: Rigidity theory (4 hr)
Freie Universität Berlin, Discrete Geometry III module
Spring 2010: Graph theory (4 cr)
Temple University, master's course
Fall 2010: Algorithms (4 cr)
Temple University, PhD core course
Spring 2009: Discrete and computational geometry (4 cr)
Temple University, undergraduate capstone course
Fall 2009: Combinatorics (4 cr)
Temple University, undergratuate elective

Seminars

Summer 2014: Tilings (2 hr)
Freie Universität Berlin, undergraduate ProSeminar
Winter 2014: Triangle tiling (2 hr)
Freie Universität Berlin, undergraduate ProSeminar
Summer 2013: Sphere packing (2 hr)
Freie Universität Berlin, undergraduate ProSeminar

Service

Dissertation committees

2017: Tom Bourne, University of St Andrews, School of Mathematics and Statistics
Thesis title:
2013: Anita Liebenau, Freie Universität Berlin, Berlin Mathematical School
Thesis title: Orientation Games and Minimal Ramsey Graphs
2011: Michael Dobbins, Temple University, Department of Mathematics
Thesis title: Representations of polytopes

Bachelor theses and projects

2017: Kestutis Vilcinskas, University of St Andrews,
Thesis title: Random graphs and graphons
My role: MMath project supervisor
2015: Lauri Tervonen, Aalto University, Computer Science
Thesis title: Strategies in the game Cordial Minuet
My role: Advisor
2014: Katherina Mölter, Freie Universität Berlin, Mathematics
Thesis title: Alternating-sign matrices, square ice, and the Yang-Baxter equation
My role: 2nd examiner
2014: Jennifer Friedrichs, Freie Universität Berlin, Mathematics
Thesis title: Über volumenstarre Fachwerke
My role: 2nd examiner
2011: Matthew Berardi, Temple University, Mathematics
Project topic: Symmetric Laman graphs
My role: supervisor
2011: Olivia Coplan, Bryn Mawr College, Mathematics
Project topic: Connectivity of hypothetical zeolite structures
My role: supervisor
2011: Garrett Wright, Temple University, Mathematics
Project topic: GPGPU linear algebra with Python
My role: supervisor

Conference organization

8.2017: Mini-symposium on Algebraic Methods in Rigidity Theory at SIAM AG2017
Co-organizer
6.2016: Summer School on Algebra, Statistics and Combinatorics (Aalto University, Helsinki)
Co-organizer and mini-course lecturer
1.2013: Special session on Discrete and Computational Geometry at the AMS Joint Math Meetings
Co-organizer
2007: Fall Workshop on Computational Geometry (FWCG'07)
Local organization (web site)
2006: Fall Workshop on Computational Geometry (FWCG'06)
Local organization

Departmental service

2016–: Research Committee, School of Mathematics and Statistics, University of St Andrews
2007–2008: Graduate student representative, Department of Computer Science, University of Massachusetts, Amherst
2006: Department steward, Graduate Employee Organization (student assistant's union), Department of Computer Science, University of Massachusetts, Amherst

Refereeing

Journals

Advances in Math. Proc. of the London Math. Soc. Discrete & Computational Geometry Philosophical Trans. of the Royal Soc., A European Journal of Combinatorics ACM Trans. on Sensor Networks SIAM J. Discrete Math.

Conferences

Symposium on Computational Geometry (SoCG) (sub-referee) Fall Workshop on Computational Geometry (FWCG) (sub-referee) Intl. Sym. Algorithms and Computation (ISAAC) (sub-referee)