k point semidefinite programming bounds for equiangular
play

k -point semidefinite programming bounds for equiangular lines Fabr - PowerPoint PPT Presentation

Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results k -point semidefinite programming bounds for equiangular lines Fabr cio C. Machado


  1. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results k -point semidefinite programming bounds for equiangular lines Fabr´ ıcio C. Machado (joint work with D. de Laat, F.M. de Oliveira Filho, and F. Vallentin) arXiv:1812.06045 Instituto de Matem´ atica e Estat´ ıstica Universidade de S˜ ao Paulo, Brasil SIAM Conference on Applied Algebraic Geometry Bern, July 9-13, 2019 1/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  2. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Acknowledgements F.C.M was supported by grant #2017/25237-4, from the S˜ ao Paulo Research Foundation (FAPESP) and was financed in part by the Coordena¸ c˜ ao de Aperfei¸ coamento de Pessoal de N´ ıvel Superior — Brasil (CAPES). 2/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  3. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Contents 1 Problem: equiangular lines and spherical codes 2 A hierarchy of k -point bounds for packing problems Independent sets The bound ∆ k ( G ) ∗ 3 Parameterizing invariant kernels on the sphere T ( x, y, Q ) and O( n ) -invariance Gegenbauer polynomials P n l Fixing a set Q ∈ I k − 2 4 Results a = 1 / 11 , 1 / 9 , 1 / 7 , 1 / 5 3/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  4. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results 1 Problem: equiangular lines and spherical codes 4/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  5. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  6. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  7. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  8. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  9. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  10. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  11. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  12. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  13. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  14. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  15. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  16. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  17. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Equiangular lines 5/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  18. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  19. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  20. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  21. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  22. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  23. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

  24. Problem: equiangular lines and spherical codes A hierarchy of k -point bounds for packing problems Parameterizing invariant kernels on the sphere Results Spherical codes x · y := � n i =1 x i y i S n − 1 := { x ∈ R n : x · x = 1 } D ⊆ [ − 1 , 1) - set of allowable inner products Examples: D = {− a, a } equiangular lines with com- mon angle arccos a | D | = s spherical s -distance sets D = [ − 1 , a ] packing of spherical caps | C | : C ⊆ S n − 1 , x · y ∈ D for all distinct x, y ∈ C � � A ( n, D ) := max 6/23 Fabr´ ıcio C. Machado k -point SDP bounds for equiangular lines

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend