Dushnik-Miller dimension of TD-Delaunay complexes

03/26/2018
by   Daniel Gonçalves, et al.
0

TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay graph of a set of points in R^2, and conversely every TD-Delaunay graph is planar. It seems natural to study the generalization of this property in higher dimensions. Such a generalization is obtained by defining an analogue of the triangular distance for R^d. It is easy to see that TD-Delaunay complexes of R^d-1 are of Dushnik-Miller dimension d. The converse holds for d=2 or 3 and it was conjectured independently by Mary and Evans et. al. to hold for larger d. Here we disprove the conjecture already for d = 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2021

Local planar domination revisited

We show how to compute a 20-approximation of a minimum dominating set in...
research
07/09/2018

How should we (correctly) compare multiple graphs?

Graphs are used in almost every scientific discipline to express relatio...
research
09/08/2019

Probabilistic Convergence and Stability of Random Mapper Graphs

We study the probabilistic convergence between the mapper graph and the ...
research
06/24/2019

On Uniquely Registrable Networks

Consider a network with N nodes in d-dimensional Euclidean space, and M ...
research
11/18/2020

On the directed tile assembly systems at temperature 1

We show here that a model called directed self-assembly at temperature 1...
research
11/24/2021

Self-orthogonality matrix and Reed-Muller code

Kim et al. (2021) gave a method to embed a given binary [n,k] code 𝒞 (k ...
research
06/26/2021

Planar and Toroidal Morphs Made Easier

We present simpler algorithms for two closely related morphing problems,...

Please sign up or login with your details

Forgot password? Click here to reset