Skip to content
A Julia package for computing a (fine) mixed subdivision and the mixed volume of lattice polytopes
Julia
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
docs
src
test
.gitignore
.travis.yml
LICENSE
Project.toml
README.md
codecov.yml

README.md

MixedSubdivisions.jl

Documentation Build Status
Build Status
Codecov branch

A Julia package for computing a (fine) mixed subdivision and the mixed volume of lattice polytopes. The mixed volume of lattice polytopes arising as Newton polytopes of a polynomial system gives an upper bound of the number of solutions of the system. This is the celebrated BKK-Theorem. A (fine) mixed subdivision can be used to efficiently solve sparse polynomial systems as first described in A Polyhedral Method for Solving Sparse Polynomial Systems by Huber and Sturmfels.

There are many algorithms for computing mixed volumes and mixed subdivisions. This implementation is based on the tropical homotopy continuation algorithm by Anders Jensen described in arXiv:1601.02818.

Installation

The package can be installed via the Julia package manager

pkg> add MixedSubdivisions
You can’t perform that action at this time.