Optimality and uniqueness of the (4,10,1/6) spherical code
| dc.creator | Bachoc, Christine | |
| dc.creator | Vallentin, Frank | |
| dc.date | 2007-08-29 | |
| dc.date | 2008-05-14 | |
| dc.date.accessioned | 2026-07-07T10:18:07Z | |
| dc.date.available | 2026-07-07T10:18:07Z | |
| dc.description | Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code. | |
| dc.description | 12 pages, (v2) several small changes and corrections suggested by referees, accepted in Journal of Combinatorial Theory, Series A | |
| dc.identifier | https://arxiv.org/abs/0708.3947 | |
| dc.identifier | http://arxiv.org/abs/0708.3947 | |
| dc.identifier | J. Comb. Theory Ser. A 116 (2009), 195-204 | |
| dc.identifier | doi:10.1016/j.jcta.2008.05.001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174087 | |
| dc.subject | Metric Geometry | |
| dc.subject | 52C17, 90C22 | |
| dc.title | Optimality and uniqueness of the (4,10,1/6) spherical code | |
| dc.type | text |