Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
extensions:tropicalcubics [2019/05/28 14:46] – [Examples] joswig | extensions:tropicalcubics [2020/02/04 13:25] – [Download] joswig |
---|
====== TropicalCubics ====== | ====== TropicalCubics ====== |
| |
This is the software companion to the article "The Schäfli fan" by | This is the software companion to the article "The Schläfli fan" by |
[[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], [[https://page.math.tu-berlin.de/~panizzut/|Marta Panizzut]] and [[https://math.berkeley.edu/~bernd/|Bernd Sturmfels]], arXiv:1905.xyz | [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], [[https://page.math.tu-berlin.de/~panizzut/|Marta Panizzut]] and [[https://math.berkeley.edu/~bernd/|Bernd Sturmfels]], [[https://arxiv.org/abs/1905.11951|arXiv:1905.11951]] |
| |
Smooth tropical cubic surfaces are parameterized by maximal cones in the unimodular secondary fan of the triple tetrahedron. There are 344 843 867 such cones, organized into a [[https://db.polymake.org|database]] of 14 373 645 symmetry classes. The Schläfli fan gives a further refinement of these cones. It reveals all possible patterns of the 27 | Smooth tropical cubic surfaces are parameterized by maximal cones in the unimodular secondary fan of the triple tetrahedron. There are 344 843 867 such cones, organized into a [[https://db.polymake.org|database]] of 14 373 645 symmetry classes. The Schläfli fan gives a further refinement of these cones. It reveals all possible patterns of the 27 |
===== Download ===== | ===== Download ===== |
| |
[[http://http://page.math.tu-berlin.de/~joswig/software/polymake/TropicalCubics-0.1.tar.xz|TropicalCubics-0.1.tar.xz]] [28 May 2019] | [[http://page.math.tu-berlin.de/~joswig/software/polymake/TropicalCubics-0.2.tar.xz|TropicalCubics-0.2.tar.xz]] [04 Feb 2020], for polymake version 4.0 |
| |
| [[http://page.math.tu-berlin.de/~joswig/software/polymake/TropicalCubics-0.1.tar.xz|TropicalCubics-0.1.tar.xz]] [28 May 2019], for polymake versions 3.5 and 3.6 |
| |
===== Installation ===== | ===== Installation ===== |
| |
This requires an installation of polymake, version 3.5, which is scheduled for July 2019 (or a developer's version no later than 28 May 2019, if you are impatient). | This requires an installation of polymake, version 3.5 or 3.6. |
| |
After download you first need to extract the code. | After download you first need to extract the code. |
===== Examples ===== | ===== Examples ===== |
| |
This extension makes contributions to the applications ''fan'' and ''tropical''. | This extension contributes to the applications ''fan'' and ''tropical''. |
| |
In the application ''tropical'' you can create a dense tropical cubic surface by just specifying the coordinates. | In the application ''tropical'' you can create a dense tropical cubic surface by just specifying the coordinates. |
</code> | </code> |
| |
Suppose you have a triangulation of $3 \Delta_3$ and you want to find it. This example comes from §6.2 of [[https://link.springer.com/chapter/10.1007/978-3-319-70566-8_14|Hampe & Joswig: Tropical computations in polymake, in: Algorithmic and experimental methods in algebra, geometry, and number theory, Springer 2017]]. This is again in application ''tropical''. | Suppose you have a triangulation of $3 \Delta_3$ and you want to find it. The next example comes from §6.2 of [[https://link.springer.com/chapter/10.1007/978-3-319-70566-8_14|Hampe & Joswig: Tropical computations in polymake, in: Algorithmic and experimental methods in algebra, geometry, and number theory, Springer 2017]]. This is again in application ''tropical''. |
<code> | <code> |
> $F = toTropicalPolynomial("min(12+3*x0,-131+2*x0+x1, | > $F = toTropicalPolynomial("min(12+3*x0,-131+2*x0+x1, |
</code> | </code> |
So this corresponds to the triangulation #5054117 constructed above (and stored in the variable ''$X''). | So this corresponds to the triangulation #5054117 constructed above (and stored in the variable ''$X''). |
| For about 99.5% of all triangulations the canonical hash value (computed by [[http://pallini.di.uniroma1.it/|nauty]]) identifies the triangulations uniquely. In the remaining cases the function ''retrieve_by_canonical_hash'' returns the first triangulation and issues a warning. |