Showing 2026Show all
2 papers · 1 filter
math.CO2026
A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
Michael Souza, Wagner da Rocha, Carlile Lavor
The Combinatorial Discretizable Distance Geometry Problem combines a finite binary lateration process with additional distance constraints. When predecessor sets are not consecutiv…
math.MG2026
A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
Michael Souza, Wagner da Rocha, Carlile Lavor
The Distance Geometry Problem (DGP) asks for a geometric realization of a weighted graph with \(n\) vertices in \(\mathbb{R}^K\) such that Euclidean distances between vertices matc…