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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 13, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Imre Bárány (Alfréd Rényi Mathematical Institute)

Jarnik's convex lattice n-gon for non-symmetric norms

What is the minimal perimeter Ln that a convex lattice polygon with n vertices can have? Jarnik proved in 1926 that Ln= (sqrt(6π)/9)n3/2+O(n3/4). Here we extend this result to all, not necessarily symmetric, norms in the plane. We also determine the limiting shape of the convex lattice n-gon minimizing the perimeter.

This is joint work with N. Enriquez.


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

Previous talks by year:   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