05.12.2012 Views

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

Inhaltsverzeichnis - Mathematisches Institut der Universität zu Köln

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

DMV Tagung 2011 - <strong>Köln</strong>, 19. - 22. September<br />

Thorsten Theobald<br />

Goethe-<strong>Universität</strong> Frankfurt am Main<br />

Combinatorial Aspects of Tropical Intersections and Self-Intersections<br />

In this talk we consi<strong>der</strong> two foundational combinatorial questions on the intersection of tropical hypersurfaces.<br />

Given tropical polynomials g1,...,gk in n variables with Newton polytopes P1,...,Pk, we first study<br />

the f -vector, the number of unbounded faces and (in case of a curve) the genus. For the case of curves,<br />

the second question is concerned with the (unweighted) number of self-intersection points un<strong>der</strong> linear<br />

projections onto the plane.<br />

Along studying these questions, we meet some intriguing connections between certain mixed volumes<br />

and alternating sums of integer points in Minkowski sums of polytopes, a mixed version of Ehrhart theory,<br />

as well as mixed fiber polytopes. While for the first problem, our characterizations are exact, for the second<br />

question our main results are bounds as well as constructions with many self-intersections.<br />

(Partially based on joint work with Kerstin Hept and with Reinhard Steffens.)<br />

Christian Haase<br />

Goethe-<strong>Universität</strong> Frankfurt am Main<br />

Computing Toric Ideals of Integrally Closed Polytopes<br />

A lattice polytope is the convex hull of finitely many points in the integer lattice. The toric ideal of such a<br />

polytope P is an ideal in a polynomial ring which encodes affine dependencies among the lattice points in<br />

P.<br />

Generating sets for these toric ideals have been used in integer programming, algebraic statistics, and<br />

many other mathematical fields. In this talk, I want to present a novel approach to compute the toric ideal<br />

of P and report on experiments with a first implementation of the algorithm.<br />

It works best un<strong>der</strong> the (checkable) additional assumption that P be integrally closed. That is, we want<br />

that every lattice point in a dilation kP of P can be written as the sum of k lattice points in P.<br />

An extension of the algorithm has the potential to compute higher Betti numbers of toric ideals.<br />

(This is joint work in progress with Benjamin Lorenz.)<br />

Matthias Henze<br />

Otto-von-Guericke-<strong>Universität</strong> Magdeburg<br />

Blichfeldt-Type Inequalities and Central Symmetry<br />

A classical result of Blichfeldt, which dates back to 1921, gives a sharp lower bound on the volume<br />

of a convex body K whose lattice points span the whole space in terms of the lattice point enumerator<br />

#(K ∩Z n ). We are interested in a version of this inequality on the set of centrally symmetric convex bodies.<br />

Our motivation to study this problem comes from a lack of methods that exploit the symmetry assumption<br />

in problems of a similar kind and where central symmetry is a natural condition.<br />

We report upon first results for special families of centrally symmetric convex bodies.<br />

(This is joint ongoing work with Martin Henk.)<br />

140

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!