Published November 14, 2019
| Version v1
Preprint
Open
Source code and examples for the paper "On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs"
Creators
- 1. Athena Research Center\\ Department of Informatics \& Telecommunications \\ National Kapodistrian University of Athens, Greece
- 2. Research Institute for Symbolic Computation\\ Johannes Kepler University, Linz, Austria
Description
1) Source code and examples in Python for the combinatorial algorithm that computes multihomogeneous Bézout bound for the embeddings of minimally rigid graphs.
2) Source code and examples in Maple for the permanent method that computes multihomogeneous Bézout bound for the embeddings of minimally rigid graphs in d=2 & d=3.
3) Maplesheets demonstrating the application of Bernstein's second theorem for the examples presented in the paper.