Semidefinite programming bounds for kissing numbers

• Grant number: 14/16058-0
• Support Opportunities: Scholarships in Brazil - Master
• Start date: October 01, 2014
• End date: August 31, 2016
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Agreement: Coordination of Improvement of Higher Education Personnel (CAPES)
• Principal Investigator: Fernando Mario de Oliveira Filho
• Grantee: Fabrício Caluza Machado
• Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
• Associated research grant: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science, AP.TEM
• Associated scholarship(s): 15/05648-4 - Improved bounds for the kissing number and related geometrical parameters, BE.EP.MS

Abstract

In this project we propose the study of optimization techniques, in particular techniques involving semidefinite programming, for computing upper bounds for the kissing number of the Euclidean space, which is the maximum number of pairwise nonoverlapping unit balls that can simultaneously touch a central unit ball. (AU)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

MACHADO, Fabrício Caluza. Semidefinite programming bounds for the kissing number. 2017. Master's Dissertation - Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME/SBI) São Paulo.