Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 18, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Chandan Dubey

Peering through the local-to-global lense at Lattices

The study of quadratic forms i.e., homogeneous polynomials of uniform degree 2, leads to a beautiful local-to-global principle. Intuitively, the principle states that if a quadratic equation has solutions modulo p^k for each prime p and positive integer k, and it has a solution over reals then it has a rational solution. Lattices can be seen as positive definite quadratic forms. In this talk, I will apply the local-to-global principle on lattices and show how to generate interesting lattices using this application. In particular, we give a significantly better algorithm for lattice generation, compared to the one based on Minkowski's work. The talk will be introductory in nature and I will trade-off most of the machinery in favor of intuitive clarity.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login