CayleyMenger - Circuit Polynomials in the Cayley Menger ideal
Document Type
Data
Publication Date
8-28-2022
Data Description
Description: The repository contains (i) a database of circuit polynomials in Cayley-Menger ideals, i.e. the minimal dependencies in the algebraic matroids of Cayley-Manger ideals. At present the database contains, up to relabeling, all circuit polynomials on 4, 5 and 6 vertices, as well as some circuit polynomials on 7 vertices and some on 8 vertices. (ii) the enumeration of truncated combinatorial resultant trees for 3-connected rigidity circuits on 6, 7 and 8 vertices.
File Formats
Requires: Wolfram Mathematica Platform: any that supports Mathematica
Abstract
Combinatorial Resultants, Combinatorial Resultant Trees and Circuit Polynomials in the Cayley Menger ideal
Recommended Citation
Malic, Goran and Streinu, I., "CayleyMenger - Circuit Polynomials in the Cayley Menger ideal" (2022). Data, Smith College, Northampton, MA.
https://scholarworks.smith.edu/dds_data/17