On prescribing total preorders and linear orders to pairwise distances of points in Euclidean space

We show that any total preorder on a set with n2 elements coincides with the order on pairwise distances of some point collection of size n in ℝ^n-1. For linear orders, a collection of n points in ℝ^n-2 suffices. These bounds turn out to be optimal. We also find an optimal bound in a bipartite version for total preorders and a near-optimal bound for a bipartite version for linear orders. Our arguments include tools from convexity and positive semidefinite quadratic forms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

Expressing Linear Orders Requires Exponential-Size DNNFs

We show that any DNNF circuit that expresses the set of linear orders ov...
research
12/11/2021

Piercing Pairwise Intersecting Geodesic Disks by Five Points

Given a simple polygon P on n vertices, and a set D of m pairwise inters...
research
09/12/2009

Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

In the context of clustering, we consider a generative model in a Euclid...
research
10/22/2018

Optimal terminal dimensionality reduction in Euclidean space

Let ε∈(0,1) and X⊂ R^d be arbitrary with |X| having size n>1. The Johnso...
research
04/26/2019

Truly Optimal Euclidean Spanners

Euclidean spanners are important geometric structures, having found nume...
research
07/09/2019

A near-linear time approximation scheme for geometric transportation with real supplies

The geometric transportation problem takes as input a set of points P in...
research
07/09/2019

A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread

The geometric transportation problem takes as input a set of points P in...

Please sign up or login with your details

Forgot password? Click here to reset