Differences between revisions 52 and 54 (spanning 2 versions)
 ⇤ ← Revision 52 as of 2017-02-28 23:13:05 → Size: 5734 Editor: tmonteil Comment: ← Revision 54 as of 2017-02-28 23:20:39 → ⇥ Size: 5132 Editor: tmonteil Comment: Deletions are marked like this. Additions are marked like this. Line 18: Line 18: ||<5%> ||<19%:> Tuesday Feb 28 ||<19%:> Wednesday Mar 1 ||<19%:> Thursday Mar 2 ||<19%:> Friday Mar 3 ||<19%>: Saturday Mar 4||||10:00 || || convex hull howto || school activity || coding sprint || coding sprint ||||after lunch || sage sample || autotools, etc || Pexpect || Sage categoris || ? ||||5 pm math talk || group cohomology || Barvinok || max plus || constraints on polytopes || ? ||Flattened alternative presentation (every free slot is made of coding sprint): Every free slot is made of coding sprint Line 28: Line 22: * 14:00 : sage sample   * 17:00 : group cohomology   * 21:00 : autotools * 14:00 : sage sample:how to make a sage package (Matthias)   * 17:00 : group cohomology (Aurel/Marc)   * 21:00 : autotools, make, etc (Matthias) Line 33: Line 27: * afternoon (depending on forecast) : Barvinok * afternoon (depending on forecast) : Barvinok (integer points in polytopes) (Matthias) Line 37: Line 31: * 14:00 : Pexpect   * 17:00 : max plus * 14:00 : Pexpect (Simon)   * 17:00 : max plus semigroup (Vincent) Line 40: Line 34: * 14:00 : Sage categoris    * 17:00 : constraints on polytopes * 14:00 : Sage categories (Vincent/Simon)   * 17:00 : combinatorial and geometrical constraints on polytopes (JP) Line 44: Line 38: Math talks * group cohomology (Aurel/Marc) * Barvinok (integer points in polytopes) (Matthias) * max plus semigroup (Vincent) * combinatorial and geometrical constraints on polytopes (JP) Unscheduled math talks: Line 52: Line 41: Development/softwares talks Unscheduled development/softwares talks: * ? Line 54: Line 44: * sage sample: how to make a sage package (Matthias) * autotools, make, etc (Matthias) * Pexpect (Simon) * convex hull howto (Matthias) * Sage categories (Vincent/Simon)

# Sage Days 84 : Polytopes (in Sage, Python, polymake and more)

February 27th - March 10th 2017 Olot, Catalunya, Spain

These (Sage) days will be focused on Polytopes and linear programming. This workshop is dedicated to people already familiar with Sage or being active in some polytope related libraries/software.

There is a very limited number of places. If you are interested get quickly in contact with Vincent Delecroix (vincentDOTdelecroixATuDASHbordeaux.fr).

During the workshop participants will have to cook several times for everybody. Bring your favorite recipies!

## Practical information

The Sage Days will happen at FABER in Olot. It is a small town close to Girona (55km) and Barcelona (110km). You can find very detailed practical information about how to reach Faber HERE.

## Schedule

Every free slot is made of coding sprint

• Tuesday Feb 28
• 09:00 : organization meeting
• 14:00 : sage sample:how to make a sage package (Matthias)
• 17:00 : group cohomology (Aurel/Marc)
• 21:00 : autotools, make, etc (Matthias)
• Wednesday Mar 1
• 10:00 : convex hull howto
• afternoon (depending on forecast) : Barvinok (integer points in polytopes) (Matthias)
• afternoon (depending on forecast) : hiking the volcanoes
• Thursday Mar 2
• 10:00 : school activity
• 14:00 : Pexpect (Simon)
• 17:00 : max plus semigroup (Vincent)
• Friday Mar 3
• 14:00 : Sage categories (Vincent/Simon)
• 17:00 : combinatorial and geometrical constraints on polytopes (JP)
• Saturday Mar 4

Unscheduled math talks:

• ?

Unscheduled development/softwares talks:

• ?

## Projects

You can have a look at our list of Sage tickets with days84 tags

• develop interfaces to polytope libraries/softwares (ppl, polymake, etc)
• moving as independent Python packages the Sage interfaces to cdd, ppl, etc (see e.g. pplpy)

• make a generic number field implementation in C/C++ using normaliz
• add mutable polytopes in Sage
• Delaunay/Voronoi polytopes of lattices (-> algorithm for norm form equation)

• release the real embedded number fields library (built on top of antic)

• Uniform random generation of integer points in polytopes
• Survey existent maintained Python bindings to MILP solvers, and see if we could use them instead of our own, those include pyomo, pulp, numberjack,...
• Atomic and Coatomic lattice Refactor this function so that it returns a lattice and so that you can input only one of the two incidences.

• #22420:Meta-ticket: Polytopes, polyhedron and their properties Increase the functionalities of polyhedron class