Preprint Open Access

Source code and examples for the paper "On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs"

Bartzos Evangelos; Schicho Josef

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.

Files (70.5 kB)
Name Size
BKK_examples.zip
md5:d6f5adf0a06b6f379346b9713e0d5342
63.3 kB Download
Maple_permanent.zip
md5:b8844cc50245f0917a685035cb63eb0b
3.0 kB Download
Python_combinatorial.zip
md5:f2738642ce3984ce51acc1b35939f9b3
3.9 kB Download
README
md5:799bd6f303a8dbe3b126e3e77e2eef28
199 Bytes Download
91
31
views
downloads
All versions This version
Views 9191
Downloads 3131
Data volume 623.7 kB623.7 kB
Unique views 8282
Unique downloads 1717

Share

Cite as