Evan DeCorte
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Evan DeCorte has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Fernando Mário de Oliveira Filho
Delft Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands
2 shared publications - Frank Vallentin
Universität zu Köln, Germany
2 shared publications David de Laat
Delft Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands
1 shared publicationFrank Vallentin
Mathematisches Institut, Universität zu Köln, Köln, Germany
1 shared publication- Konstantin Golubev
D-MATH ETH Zurich Switzerland
1 shared publication
Latest Publications
- Open Access
Complete positivity and distance-avoiding sets
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.
Open AccessComplete positivity and distance-avoiding sets
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.
- Open Access
- 16 September 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (2) , 487-558
Complete positivity and distance-avoiding sets
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.
- 16 September 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (2) , 487-558
Open AccessComplete positivity and distance-avoiding sets
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.
- 5 September 2018
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (2) , 481-496
Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane
- 5 September 2018
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (2) , 481-496
Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane
- 3 April 2014
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 23 (2) , 146-152
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs
We apply Fourier analysis on finite groups to obtain simplified formulations for the Lovász ϑ-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a recent article proving a version of the Erdös–Ko–Rado theorem for k-intersecting families of permutations. We also introduce a q-analogue of the notion of k-intersecting families of permutations, and we verify a few cases of the corresponding Erdös–Ko–Rado assertion by computer.
- 3 April 2014
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 23 (2) , 146-152
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs
We apply Fourier analysis on finite groups to obtain simplified formulations for the Lovász ϑ-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a recent article proving a version of the Erdös–Ko–Rado theorem for k-intersecting families of permutations. We also introduce a q-analogue of the notion of k-intersecting families of permutations, and we verify a few cases of the corresponding Erdös–Ko–Rado assertion by computer.