Author:
DeCorte Evan,Filho Fernando Mário de Oliveira,Vallentin Frank
Abstract
AbstractWe 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.
Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
FAPESP
DFG
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference48 articles.
1. Bachoc, C., Nebe, G., de Oliveira Filho, F.M., Vallentin, F.: Lower bounds for measurable chromatic numbers. Geom. Funct. Anal. 19, 645–661 (2009)
2. Bachoc, C., Passuello, A., Thiery, A.: The density of sets avoiding distance 1 in Euclidean space. Discrete Comput. Geom. 53, 783–808 (2015)
3. Barvinok, A.: A Course in Convexity. Graduate Studies in Mathematics 54. American Mathematical Society, Providence, RI (2002)
4. Bochner, S.: Hilbert distances and positive definite functions. Ann. Math. 42, 647–656 (1941)
5. Bourgain, J.: A Szemerédi type theorem for sets of positive density in $${\mathbb{R}}^k$$. Isr. J. Math. 54, 307–316 (1986)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献