Bounds on the Maximum Number of Vectors with given Scalar Products
From MaRDI portal
Publication:3784099
DOI10.2307/2044537zbMath0643.05041OpenAlexW4247378686MaRDI QIDQ3784099
Peter Frankl, Michel Marie Deza
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2044537
Extremal problems in graph theory (05C35) Distance geometry (51K99) Euclidean geometries (general) and generalizations (51M05) Finite geometry and special incidence structures (51E99)
Related Items
On the strong non-rigidity of certain tight Euclidean designs, Binary scalar products, Inside s-inner product sets and Euclidean designs, Cubature formulas in numerical analysis and Euclidean tight designs, Problems from CGCS Luminy, May 2007, A Helly type theorem for hypersurfaces, A survey on spherical designs and algebraic combinatorics on spheres
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- On finite set-systems whose every intersection is a kernel of a star
- On t-distance sets of (0,+-1)-vectors
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- On a packing and covering problem
- On large vector systems with equal scalar products
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Intersection theorems with geometric consequences
- On t-designs
- Spherical codes and designs
