polymake

swMATH724WikidataQ7226517 ScholiaQ7226517MaRDI QIDQ13478FDOQ13478

Ewgenij Gawrilow, Michael Joswig

Source code repository: https://github.com/polymake/polymake

Description

polymake is open source software for research in polyhedral geometry. It deals with polytopes, polyhedra and fans as well as simplicial complexes, matroids, graphs, tropical hypersurfaces, and other objects. Supported platforms include various flavors of Linux, FreeBSD and Mac OS.

Described by source

• The polymake XML File Format
• Polymake and Lattice Polytopes
• polymake: a framework for analyzing convex polytopes
• Polymake: an approach to modular software design in computational geometry

Cited In (only showing first 100 items - show all)

• On geometry of binary symmetric models of phylogenetic trees
• Special cycles in independence complexes and superfrustration in some lattices
• Minkowski decomposition of associahedra and related combinatorics
• Computing All Maps into a Sphere
• Existence of unimodular triangulations — positive results
• Convex hulls, oracles, and homology
• The combinatorics of interval vector polytopes
• Gorenstein property for phylogenetic trivalent trees
• Tropical Geometry
• Favourable modules: filtrations, polytopes, Newton-Okounkov bodies and flat degenerations
• New compact forms of the trigonometric Ruijsenaars-Schneider system
• Exploiting polyhedral symmetries in social choice
• Tight complexes in 3-space admit perfect discrete Morse functions
• Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds
• On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts
• Splittings of independence complexes and the powers of cycles
• Viterbi sequences and polytopes
• Compressed polytopes and statistical disclosure limitation
• Roots of Ehrhart polynomials arising from graphs
• Galois groups of Schubert problems via homotopy computation
• Convex relaxations for mixed-integer nonlinear programs
• Algorithms for highly symmetric linear and integer programs
• Cardinality constrained combinatorial optimization: complexity and polyhedra
• Experimental study of energy-minimizing point configurations on spheres
• Convex rank tests and semigraphoids
• The regularized feasible directions method for nonconvex optimization
• Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes
• A geometric interpretation of the characteristic polynomial of reflection arrangements
• On the Monotone Upper Bound Problem
• From curves to tropical Jacobians and back
• On the factor alpha in Peyre's constant
• \(K3\) polytopes and their quartic surfaces
• Homometry and direct-sum decompositions of lattice-convex sets
• Tropical geometry of genus two curves
• On the facets of the secondary polytope
• Tropicalization of classical moduli spaces
• Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
• Complexes of discrete Morse functions
• A counterexample to the Hirsch conjecture
• On the balanced minimum evolution polytope
• Three Counter-Examples on Semi-Graphoids
• Algebraic statistics for a directed random graph model with reciprocation
• Characterization of tropical plane curves up to genus six
• Book review of: D. Maclagan and B. Sturmfels, Introduction to tropical geometry
• Exact algorithms and software in optimization and polyhedral computation
• Title not available (Why is that?)
• The intersection ring of matroids
• On cardinality constrained cycle and path polytopes
• Facets of the \((s,t)-p\)-path polytope
• Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
• Smooth monomial Togliatti systems of cubics
• PBW-degenerated Demazure modules and Schubert varieties for triangular elements
• The power of pyramid decomposition in Normaliz
• Decomposable Pauli diagonal maps and tensor squares of qubit maps
• The tropical totally positive Grassmannians
• Order-chain polytopes
• The flag polynomial of the Minkowski sum of simplices
• Hamiltonian submanifolds of regular polytopes
• Combinatorics of tropical Hurwitz cycles
• Geometric and topological combinatorics. Abstracts from the workshop held January 28 -- February 3, 2007.
• The hyperdeterminant and triangulations of the 4-cube
• A general method to determine limiting optimal shapes for edge-isoperimetric inequalities
• The polytope of \(k\)-star densities
• The linear extension polytope of a poset
• A test for monomial containment
• Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
• On Minkowski sums of simplices
• Title not available (Why is that?)
• Computer algebra in scientific computing. 19th international workshop, CASC 2017, Beijing, China, September 18--22, 2017. Proceedings
• Estimation of the dimensions of some Kisin varieties
• Ideals of graph homomorphisms
• Products of foldable triangulations
• Isotropical linear spaces and valuated Delta-matroids
• \(sl_{n}\) level 1 conformal blocks divisors on \(\overline{M_{0,n}}\)
• Tverberg's theorem with constraints
• Title not available (Why is that?)
• General embedding problems and two-distance sets in Minkowski planes
• Terminal toric Fano \(3\)-folds with numerical conditions
• Newton-Okounkov bodies, cluster duality, and mirror symmetry for Grassmannians
• Polyhedral and algebraic methods in computational geometry
• Parametric analysis of alignment and phylogenetic uncertainty
• Gcd of multivariate polynomials via Newton polytopes
• Minimal zonotopes containing the crosspolytope
• Toric geometry in polymake
• Computing in arithmetic groups with Voronoï's algorithm.
• Grid graphs, Gorenstein polytopes, and domino stackings
• Determinantal schemes and pure O-sequences
• Neighborly cubical polytopes and spheres
• New polytopes from products
• On the relationship between Ehrhart unimodality and Ehrhart positivity
• Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
• Combinatorial mutations and block diagonal polytopes
• Lossy gossip and composition of metrics
• On rigidity of toric varieties arising from bipartite graphs
• Generalized multiplicities of edge ideals
• Webs of stars or how to triangulate free sums of point configurations
• A bound for the splitting of smooth Fano polytopes with many vertices
• Algorithmic geometry. Polyhedric and algebraic methods
• A computational approach to the ample cone of moduli spaces of curves
• PPLite: zero-overhead encoding of NNC polyhedra

This page was built for software: polymake