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/27 13:35] – [Lattice Polytopes and Toric Geometry] Remove deprecated extensions, most of the functionality is in core anyway lkastner | extensions [2020/03/18 12:36] – joswig |
---|
===== Tropical Geometry ===== | ===== Tropical Geometry ===== |
| |
| * Michael Joswig, Marta Panizzut, Bernd Sturmfels: [[extensions:tropicalcubics|Tropical Cubics]] |
| * Ewgenij Gawrilow, Michael Joswig, Benjamin Schröter: [[extensions:polytropes|polytropes]] |
* Simon Hampe: [[https://github.com/simonhampe/atint|Algorithmic tropical intersection theory]] (now bundled with polymake) | * Simon Hampe: [[https://github.com/simonhampe/atint|Algorithmic tropical intersection theory]] (now bundled with polymake) |
* Silke Horn: [[http://solros.de/polymake/tropmat/|Tropical Oriented Matroids]] | * Silke Horn: [[http://solros.de/polymake/tropmat/|Tropical Oriented Matroids]] |
* 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. |