Polymake

Polymake
Original author(s) Ewgenij Gawrilow and Michael Joswig
Stable release
3.0 / January 8, 2016
Written in C++, Perl
Operating system Linux, Mac
Available in English
License GNU General Public License
Website polymake.org

Polymake is software for the algorithmic treatment of convex polyhedra.[1]

Albeit primarily a tool to study the combinatorics and the geometry of convex polytopes and polyhedra, it is by now also capable of dealing with simplicial complexes, matroids, polyhedral fans, graphs, tropical objects, toric varieties and other objects.

Polymake has been cited in over 100 recent articles indexed by Zentralblatt MATH as can be seen from its entry in the swMATH database.[2]

Special Features

modular

Polymake was originally designed as a research tool for studying aspects of polytopes.[3] As such, polymake uses many third party software packages for specialized computations, thereby providing a common interface and bridge between different tools. A user can easily (and unknowingly) switch between using different software packages in the process of computing properties of a polytope.[4]

rule based computation

Polymake internally uses a server-client model where the server holds information about each object (e.g., a polytope) and the clients sends requests to compute properties. The server has the job of determining how to complete each request from information already known about each object using a rule based system.[5] For example, there are many rules on how to compute the facets of a polytope. Facets can be computed from a vertex description of the polytope, and from a (possibly redundant) inequality description. Polymake builds a dependency graph outlining the steps to process each request and selects the best path via a Dijkstra type algorithm.[5]

scripting

Polymake can be used within a perl script. Moreover, users can extend polymake and define new objects, properties, rules for computing properties, and algorithms.[6]

Polymake applications

Polymake divides its collection of functions and objects into 10 different groups called applications. They behave like C++ namespaces. The polytope application was the first one developed and it is the largest.[7]

Common application

This application contains many "helper" functions used in other applications.[8]

Fan application

The Fan application contains functions for polyhedral complexes (which generalize simplicial complexes), planar drawings of 3-polytopes, polyhedral fans, and subdivisions of points or vectors.[9]

Fulton application

This application deals with normal toric varieties. The name of this application is from the book "Introduction to toric varieties" by William Fulton.[10]

Graph application

The graph application is for manipulating directed and undirected graphs. Some the standard graph functions exist (like for adjacency and cliques) together with combinatorial functions like computing the lattice represented by a directed acyclic graph.[11]

Group application

The group application focuses on finite permutation groups. Basic properties of a group can be calculated like characters and conjugacy classes.[12] Combined with a polytope, this application can compute properties associated with a group acting on a polytope by permuting the polytope's vertices, facets, or coordinates.

Ideal application

The ideal application computes a few properties of polynomial ideals: Groebner basis, Hilbert polynomial, and radicals.[13]

Matriod application

The matroid class can compute all the standard properties of a matriod like bases and circuits. This application can also compute more advance properties like the Tutte polynomial of a matroid and realizing the matriod with a polytope.[14]

Polytope application

Within the polytope application, there are over 230 functions or calculations that can be done with a polytope. These functions range in complexity from simply calculating basic information about a polytope (e.g., number of vertices, number of facets, tests for simplicial polytopes, and converting a vertex description to an inequality description) to combinatorial or algebraic properties (e.g., H-vector, Ehrhart polynomial, Hilbert basis, and Schlegel diagrams).[7] There are also many visualization options.

Topaz application

The Topaz application contains all the functions relating to abstract simplicial complexes.[15] Many advance topological calculations over simplicial complexes can be performed like homology groups, orientation, fundamental group. There is also a combinatorial collection of properties that can be computed like a shelling and Hasse diagrams.

Tropical application

The tropical application contains functions for exploring tropical geometry; in particular, tropical hypersurfaces and tropical cones.[16]

Development History

Polymake version 1.0 first appeared in the proceedings of the International Congress of Mathematicians in 1989 in a new section on mathematical software.[17] Version 1.0 only contained the polytope application, but the system of "applications" was not yet developed. Version 2.0 was released sometime in 2003, and version 3.0 was released in 2016.[18]

Software packages

Used within polymake

Below is a list of third party software packages that polymake can interface with as of version 3.0. Users are also able to write new rule files for interfacing with any software package. Note that there is some redundancy in this list (e.g., a few different packages can be used for finding the convex hull of a polytope). Because polymake uses rule files and a dependency graph for computing properties,[6] most of these software packages are optional. However, some become necessary for specialized computations.

Used in conjunction with polymake

References

  1. ↑ Official Website
  2. ↑ http://swmath.org/software/724
  3. ↑ Gawrilow, Ewgenij; Joswig, Michael (2000-01-01). Kalai, Gil; Ziegler, Günter M., eds. polymake: a Framework for Analyzing Convex Polytopes. Polytopes—combinatorics and computation, DMV Seminar. Birkhäuser Basel. pp. 43–73. doi:10.1007/978-3-0348-8438-9_2. ISBN 9783764363512.
  4. ↑ Gawrilow, Ewgenij; Joswig, Michael (2001-01-01). "Polymake: An Approach to Modular Software Design in Computational Geometry". Proceedings of the Seventeenth Annual Symposium on Computational Geometry. SCG '01. New York, NY, USA: ACM: 222–231. doi:10.1145/378583.378673. ISBN 158113357X.
  5. 1 2 Gawrilow, Ewgenij; Joswig, Michael (2005-07-13). "Geometric Reasoning with polymake".
  6. 1 2 Joswig, Michael; Müller, Benjamin; Paffenholz, Andreas (2009-02-17). "Polymake and Lattice Polytopes". arXiv:0902.2919Freely accessible.
  7. 1 2 "polymake documentation, application: polytope". polymake.org. Retrieved 2016-06-11.
  8. ↑ "polymake documentation, application: common". polymake.org. Retrieved 2016-06-11.
  9. ↑ "polymake documentation, application: fan". polymake.org. Retrieved 2016-06-11.
  10. ↑ "polymake documentation, application: fulton". polymake.org. Retrieved 2016-06-11.
  11. ↑ "polymake documentation, application: graph". polymake.org. Retrieved 2016-06-11.
  12. ↑ "polymake documentation, application: group". polymake.org. Retrieved 2016-06-11.
  13. ↑ "polymake documentation, application: ideal". polymake.org. Retrieved 2016-06-11.
  14. ↑ "polymake documentation, application: matroid". polymake.org. Retrieved 2016-06-11.
  15. ↑ "polymake documentation, application: topaz". polymake.org. Retrieved 2016-06-11.
  16. ↑ "polymake documentation, application: tropical". polymake.org. Retrieved 2016-06-11.
  17. ↑ Joswig, Michael; Gawrilow, Ewgenij (1998). "Polymake". Proceedings of the International Congress of Mathematicians. Berlin.
  18. ↑ "Polymake 3.0". GitHub. Retrieved 2016-06-28.
This article is issued from Wikipedia - version of the 7/19/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.