Jesus De Loera

Research

Professor Jesus De Loera works in discrete and computational geometry, in particular on the combinatorial structure of convex polytopes. Convex polytopes in two and three dimensions (polygons and polyhedra) were extensively studied by the ancient Greeks. In this century convex polytopes have appeared in many areas of mathematics. They appear in algebraic geometry in connection with toric varieties; they are central to linear programming and other arXiv:math.CO/0303.5228.

Selected Publications

[1] "A Polytopal Generalization of Sperner's lemma," (with E. Peterson and F. Su), Journal of Combinatorial Theory (A), 100: 1—26, 2002.

[2] "The complexity of finding small triangulations of convex 3-polytopes," (with Alexander Below and Jürgen Richter-Gebert), to appear in Journal of Algorithms, 50(2): 134—167, 2004, arXiv:math.CO/0012177.

[3] "Counting integer flows in networks," (with W. Baldoni-Silva and M. Vergne), Foundations of Computational Mathematics}, 4, 277—314, 2004, arXiv:math.CO/0303.5228.

[4] "Integer polynomial optimization in fixed dimension," (with R. Hemmecke, M. Koeppe, and R. Weismantel), Mathematics of Operations Research, 31(1): 147—153, 2006, arXiv:math.CO/0410.5111.

[5] "All linear and integer programming problems are slim 3-way transportation programs," (with S. Onn), SIAM J. of Optimization, 17(3): 806—821, 2006, MathSciNet2257210.

Honors and Awards

• UC Davis Chancellor fellow 2003-2008

• Alexander von Humboldt fellow 2004-2005

• UC Davis Graduate Student Association Award for Excellence in Service 2007

Last updated: 2008/02/12