Skip to content

A Julia package for computing a (fine) mixed subdivision and the mixed volume of lattice polytopes

License

Notifications You must be signed in to change notification settings

saschatimme/MixedSubdivisions.jl

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MixedSubdivisions.jl

Documentation Build Status
Run tests
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

About

A Julia package for computing a (fine) mixed subdivision and the mixed volume of lattice polytopes

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages