Linear programming bounds for covering radius of spherical designs

DOI10.1007/S00025-021-01400-XMaRDI QIDQ2038844zbMATH OpenOpenAlexFDO

Authors Peter Boyvalenkov, M. M. Stoyanova

Publication date 7 July 2021

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.05599

zbMATH Keywords

covering radiuslinear programmingspherical designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40) Association schemes, strongly regular graphs (05E30) Linear programming (90C05)

Abstract: We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower bounds due to Fazekas and Levenshtein and propose new upper bounds. Our approach to the lower bounds involves certain signed measures whose corresponding series of orthogonal polynomials are positive definite up to a certain (appropriate) degree. Upper bounds are based on a geometric observation and more or less standard linear programming techniques.

Recommendations

• On linear programming bounds for spherical codes and designs
• Upper bounds on the minimum distance of spherical codes
• Publication:4504299
• The covering radius of spherical designs
• scientific article; zbMATH DE number 1456826

Cites work

• Covering a sphere and extremal properties of orthogonal polynomials
• Extremal polynomials for obtaining bounds for spherical codes and designs
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• scientific article; zbMATH DE number 2237360 (Why is no real title available?)
• Improvement of the Delsarte bound for -designs when it is not the best bound possible
• Lower bounds for spherical designs
• Necessary conditions for existence of some designs in polynomial metric spaces
• On spherical codes with inner products in a prescribed interval
• On tight spherical designs
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Optimal asymptotic bounds for spherical designs
• Polynomial techniques for investigation of spherical designs
• Spherical codes and designs
• The nonexistence of certain tight spherical designs
• Tight spherical designs. I
• Tight Spherical Disigns, II
• Universally optimal distribution of points on spheres
• Well-separated spherical designs

Cited in

(9)

• The covering radius of spherical designs
• On polarization of spherical codes and designs
• scientific article; zbMATH DE number 1189051 (Why is no real title available?)
• scientific article; zbMATH DE number 1505513 (Why is no real title available?)
• Covering a sphere and extremal properties of orthogonal polynomials
• Universal minima of discrete potentials for sharp spherical codes
• On linear programming bounds for spherical codes and designs
• New bounds on the covering radius of orthogonal arrays of even strength
• Hybrid spherical designs

This page was built for publication: Linear programming bounds for covering radius of spherical designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038844)