Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
type: Item
instance of: scholarly article
title: Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
zbMATH Open document ID: 1401.52028
DOI: 10.1080/10586458.2017.1286273
author: Fabrício Caluza Machado
author: Fernando Mário de Oliveira Filho
published in: Experimental Mathematics
publication date: 2018-10-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1609.05167
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6959341
zbMATH Keywords: kissing number
zbMATH Keywords: semidefinite programming
zbMATH Keywords: invariant semidefinite programs
zbMATH Keywords: symmetric polynomials
describes a project that uses: MPFI
MaRDI profile type: Publication
OpenAlex ID: W2963419410
arXiv ID: 1609.05167
Wikidata QID: Q111288233
cites work: Invariant Semidefinite Programs
cites work: New upper bounds for kissing numbers from semidefinite programming
cites work: Q4039784
cites work: Spherical codes and designs
cites work: Symmetry groups, semidefinite programs, and sums of squares
cites work: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
cites work: The kissing number in four dimensions
cites work: New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
cites work: Motivations for an arbitrary precision interval arithmetic and the MPFI library
cites work: Das Problem der dreizehn Kugeln
cites work: Q4126536
cites work: Algorithms in invariant theory
cites work: Q4061445
cites work: New lower bounds for contact numbers in small dimensions
Recommended article: New upper bounds for kissing numbers from semidefinite programming
Recommended article: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Recommended article: Semidefinite programming bounds for the average kissing number
Recommended article: On an SDP relaxation for kissing number
Recommended article: On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
Recommended article: Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
Recommended article: The Kissing Number Problem: A New Result from Global Optimization
Recommended article: Polynomial time solvability of non-symmetric semidefinite programming
Recommended article: Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Recommended article: Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31
description: scientific article; zbMATH DE number 6959341