6th polymake conference and developer meeting at TU Berlin (St. Nicholas special)

December 5, 2014

On Friday there will be two invited talks and several tutorial and helpdesk sessions for polymake users.

The registration fee for the tutorials is 5 Euros.

Participants are encouraged to bring their own laptop and use them in the tutorials, preferably with an installed version of polymake. See the Perpetual Beta Section for the most recent beta version of polymake or check the Download Section for the latest release (2.13). If you have any polymake problem you want to get help during the workshop please describe your problem during the sign up process.

The conference takes place in the math building of TU Berlin:
Rooms MA313 and MA315,
Str. des 17. Juni 136,
10623 Berlin
see also: http://www.math.tu-berlin.de/

Registration please fill out the registration form: Link

09:00-09:30 Registration
09:30-10:30 Building Algorithmic Polytopes
David Bremner
Room: MA313
10:30-11:00 Coffee and Helpdesk
Room: MA315
11:00-12:00 Tut: basics (perl) Tut: C++ code
Assarf/Kastner Lorenz/Müller
Room: MA313 Room: MA315
12:00-14:00 Lunch
14:00-15:00 Very ample and Koszul segmental fibrations
Matthias Beck
Room: MA313
15:00-15:30 Coffee and Helpdesk
Room: MA315
15:30-16:30 Tut: topaz Tut: tropical/atint
Michael Joswig Simon Hampe
Room: MA313 Room: MA315
16:30-18:00 Helpdesk
Rooms: MA313 / MA315 / MA621 / …
~19:00 Dinner (self paid)

David Bremner: Building Algorithmic Polytopes – Slides

In this talk I will discuss ongoing work to develop a compiler from a simple ALGOL-like pseudocode to polynomial sized linear programs. These LPs can compute the output for any input (of a given size) to the corresponding algorithm by a trivial encoding of the input into the objective function. The talk will cover the structure of the inequalities needed to simulate a simple bit-oriented register machine supporting arithmetic and arrays, and a limited kind of integrality guarantee needed to solve these systems as linear, rather than integer linear programs. I'll also give an overview of the current compiler implementation, and time permitting a demo.
This talk shares some background and motivation with my recent MDS seminar on “Succinct linear programs for easy problems”, but it should be accessible to people that missed that, and mostly new to people that saw the previous talk.

Matthias Beck: Very ample and Koszul segmental fibrations – Slides

A lattice polytope P ⊂ Rn is the convex hull of finitely many points in Zn. There is a natural hierarchy of structural sophistication for lattice polytopes, with various concepts motivated from toric geometry and commutative algebra. We will discuss three such concepts in this hierarchy, occupying a point of origin (normality), the bottom (very ampleness), and the top spot (Koszul property). More specifically, we explore a simple construction for lattice polytopes with a twofold aim. On the one hand, we derive an explicit series of very ample 3-dimensional polytopes with arbitrarily large deviation from the normality property, measured via the highest discrepancy degree between the corresponding Hilbert functions and Hilbert polynomials. On the other hand, we describe a large class of Koszul polytopes of arbitrary dimensions, containing many smooth polytopes and extending the previously known class of Nakajima polytopes.
This is joint work with Jessica Delgado, Joseph Gubeladze, and Mateusz Michalek.

The developer meeting takes place on December 4th and 6th.

On Thursday we will have general discussions on important topics and tickets, and assign tickets/tasks to small teams for the coding session on Saturday.

Topics sorted somewhat by importance:

  • Mac OS X 10.10
  • debian package
  • gfan interface
  • consolidate application tropical
  • permlib (headers and quadratic extensions)
  • matrix group orbits
  • application matroid (POINTS / VECTORS ?, symmetry?, names)
  • more data/properties for the database
  • parallel polymake
  • (Default-)comparator for arrays
  • jreality visual error / preference (javaview)
  • new big object: oriented matroids
  • new big object: hyperplane arrangements
  • new small object: quasi-polynomials
  • forum migration
  • code coverage sessions
  • implicit type conversions??
  • documentation of rings, polynomial, …

See the roadmap!

Please feel free to add more topics!


Allocating people and slots, starting around 15:00.


Coding session in small groups with status report every two hours at MA621. With PIZZA for lunch!

  • workshops/workshop1214.txt
  • Last modified: 2019/01/29 21:46
  • (external edit)