Complete positivity and distance-avoiding sets
Evan DeCorte (McGill University)
Fernando Mário de Oliveira Filho (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Frank Vallentin (Universität zu Köln)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We introduce the cone of completely positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
help_outline