The m-Bézout bound and distance geometry
From MaRDI portal
Publication:831957
DOI10.1007/978-3-030-85165-1_2OpenAlexW3195408583MaRDI QIDQ831957
Charalambos Tzamos, Evangelos Bartzos, Ioannis Z. Emiris
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85165-1_2
Related Items (3)
New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ An asymptotic upper bound for graph embeddings
Uses Software
Cites Work
- Unnamed Item
- On symmetric and skew-symmetric determinantal varieties
- Mixed volume techniques for embeddings of Laman graphs
- The number of roots of a system of equations
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- The number of embeddings of minimally rigid graphs
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Distance geometry and data science
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- Computing minimal multi-homogeneous Bezout numbers is hard
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
- Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Root counts of semi-mixed systems, and an application to counting nash equilibria
- Periodic tilings and auxetic deployments
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
This page was built for publication: The m-Bézout bound and distance geometry
