This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
| extensions [2019/05/16 12:03] – [Lattice Polytopes and Toric Geometry] paffenholz | extensions [2019/12/17 10:07] – benmuell |
|---|
| |
| ===== Lattice Polytopes and Toric Geometry ===== | ===== Lattice Polytopes and Toric Geometry ===== |
| |
| * Lars Kastner/Benjamin Lorenz: [[https://github.com/lkastner|Toric Varieties and Singular interface]] | |
| |
| * Benjamin Lorenz: [[http://ehrhart.math.fu-berlin.de/people/benmuell/classification.html|classification of smooth lattice polytopes with few lattice points]] | |
| |
| * Silke Horn/Andreas Paffenholz: | * Silke Horn/Andreas Paffenholz: |
| * Matthias Walter: [[https://github.com/xammy/polymake-extended-formulations|This extension]] can compute nonnegative slack matrix factorizations from extended formulations of polytopes and vice versa. See [[https://github.com/xammy/polymake-extended-formulations/wiki|here]] for more information. | * Matthias Walter: [[https://github.com/xammy/polymake-extended-formulations|This extension]] can compute nonnegative slack matrix factorizations from extended formulations of polytopes and vice versa. See [[https://github.com/xammy/polymake-extended-formulations/wiki|here]] for more information. |
| |
| ===== Phylogentics ===== | ===== Phylogenetics ===== |
| |
| * Sven Herrmann: [[http://www.uea.ac.uk/computing/quasidec|QuasiDec]]. This extension contains an algorithm for computing the block decomposition of a quasi-median graph obtained from a set of partitions or a sequence alignment. | * Sven Herrmann: [[http://www.uea.ac.uk/computing/quasidec|QuasiDec]]. This extension contains an algorithm for computing the block decomposition of a quasi-median graph obtained from a set of partitions or a sequence alignment. |