| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
| extensions [2019/03/21 13:42] – polyDB no extension loewe | extensions [2019/05/16 12:03] – [Lattice Polytopes and Toric Geometry] 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 ===== |
| ===== 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 ===== |