scientific article; zbMATH DE number 1341365
From MaRDI portal
Publication:4262989
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1999)7:5<316::AID-JCD2>3.0.CO;2-Z" /><316::AID-JCD2>3.0.CO;2-Z 10.1002/(SICI)1520-6610(1999)7:5<316::AID-JCD2>3.0.CO;2-ZzbMath0948.94021MaRDI QIDQ4262989
Danyo Danev, Ivan N. Landgev, P. G. Boyvalenkov
Publication date: 14 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs ⋮ Universal lower bounds for potential energy of spherical codes ⋮ A method for proving nonexistence of spherical designs of odd strength and odd cardinality ⋮ A survey on spherical designs and algebraic combinatorics on spheres
Cites Work
- Strongly regular graphs having strongly regular subconstituents
- Designs as maximum codes in polynomial metric spaces
- On rank 3 permutation groups
- Spherical codes and designs
- Tight spherical designs. I
- Computing distance distributions of spherical designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Partially balanced incomplete block designs with two associate classes and two treatments per block
- Tight Spherical Disigns, II
- Upper bounds on the minimum distance of spherical codes
- Graphs with Maximal Even Girth
This page was built for publication:
