Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
extensions [2018/08/29 13:11] – [Other] gawrilow | extensions [2019/12/17 10:11] – benmuell |
---|
====== Available Extensions ====== | ====== Available Extensions ====== |
| |
''polymake'' supports an [[reference/extensions|extension system]] for writing and maintaining outside the distribution. Please contact the extension's authors if you have questions. | ''polymake'' supports an [[user_guide:extend:extensions|extension system]] for writing and maintaining outside the distribution. Please contact the extension's authors if you have questions. |
| |
===== Lattice Polytopes and Toric Geometry ===== | ===== Lattice Polytopes and Toric Geometry ===== |
| |
* Silke Horn: [[http://solros.de/polymake/poly_db|poly_db]]. Access to the [[data|polymake polytope database]]. | |
* releases and other information: [[http://solros.de/polymake/poly_db|poly_db]] | |
* [[tutorial/poly_db_tutorial|tutorial]] | |
* latest: [[http://github.com/solros/poly_db|github]] | |
| |
* 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: |
* //defect polytopes//: This extension allows computations used in [[http://arxiv.org/abs/1105.5027|Joswig, Paffenholz: Defect Polytopes and Counter-Examples with polymake, arxiv:1105:5027]] | * //defect polytopes//: This extension allows computations used in [[http://arxiv.org/abs/1105.5027|Joswig, Paffenholz: Defect Polytopes and Counter-Examples with polymake, arxiv:1105:5027]] |
* polymake 2.12: [[http://www.mathematik.tu-darmstadt.de/~paffenholz/software.html|DefectPolytopes-v0.1]] | * polymake 2.12: [[http://www.mathematik.tu-darmstadt.de/~paffenholz/software.html|DefectPolytopes-v0.1]] |
* //[[https://github.com/apaffenholz/polymake_projectionWithSubdivision|projection_with_subdivision]]//: Projections of smooth polytopes together with the hyperplane subdivision implied by the facets. | * //[[https://github.com/apaffenholz/polymake_projection_with_subdivision|projection_with_subdivision]]//: Projections of smooth polytopes together with the hyperplane subdivision implied by the facets. |
* {{:download:barvinok-extension-1.0.tar.bz2}}\\ This extension lets you use [[http://www.kotnet.org/~skimo/barvinok/|barvinok]] by Sven Verdolaege for the computation of the number of lattice points in a rational polytope and the coefficients of the Ehrhart polynomial of a lattice polytope. | * {{:download:barvinok-extension-1.0.tar.bz2}}\\ This extension lets you use [[http://barvinok.gforge.inria.fr/|barvinok]] by Sven Verdolaege for the computation of the number of lattice points in a rational polytope and the coefficients of the Ehrhart polynomial of a lattice polytope. |
| |
===== Tropical Geometry ===== | ===== Tropical Geometry ===== |
| |
| * Michael Joswig, Marta Panizzut, Bernd Sturmfels: [[extensions:tropicalcubics|Tropical Cubics]] |
* 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]] |
===== Integer Programming ===== | ===== Integer Programming ===== |
| |
* Matthias Walter: With [[http://github.com/xammy/unimodularity-test/wiki/Polymake-Extension|this extension]] you can test an integer matrix for total unimodularity. If the answer is "no", it can return the row/column indices of a submatrix with |det| >= 2. It can also test for the related properties (strong) unimodularity, (strong) k-modularity and the Dantzig property. See [[http://www.math.uni-magdeburg.de/~walter/TUtest/|here]] for more information on implementation and theory. | * Matthias Walter: With [[http://github.com/xammy/unimodularity-test/wiki/Polymake-Extension|this extension]] you can test an integer matrix for total unimodularity. If the answer is "no", it can return the row/column indices of a submatrix with |det| >= 2. It can also test for the related properties (strong) unimodularity, (strong) k-modularity and the Dantzig property. See [[http://matthiaswalter.org/TUtest/|here]] for more information on implementation and theory. |
| |
===== Extended Formulations ===== | ===== Extended Formulations ===== |
* 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. |
* Sven Herrmann and Andreas Spillner: [[http://www.uea.ac.uk/computing/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces. | * Sven Herrmann and Andreas Spillner: [[http://www.uea.ac.uk/computing/comrit|CoMRiT]]. This extensions contains a new application metric introducing finite metric spaces as objects. The core feature is an algorithm to compute a realisation of a finite metric space using the tight-span, as described in Herrmann, Moulton, Spillner: Computing Realizations of Finite Metric Spaces. |
| |
===== Other ===== | |
| |
* Silke Horn: [[http://solros.de/polymake/poly_db|poly_db]]. Access to the [[data|polymake polytope database]]. (Now bundled with polymake) | |
* releases and other information: [[http://solros.de/polymake/poly_db|poly_db]] | |
* [[tutorial/poly_db_tutorial|tutorial]] | |
* latest: [[http://github.com/solros/poly_db|github]] | |
| |