Bounds on the Maximum Number of Vectors with given Scalar Products
From MaRDI portal
Publication:3784099
DOI10.2307/2044537zbMATH Open0643.05041OpenAlexW4247378686MaRDI QIDQ3784099FDOQ3784099
Authors: Peter Frankl, Michel 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)
Cites Work
- On a packing and covering problem
- Intersection theorems with geometric consequences
- Title not available (Why is that?)
- Spherical codes and designs
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- Title not available (Why is that?)
- On t-designs
- On finite set-systems whose every intersection is a kernel of a star
- Title not available (Why is that?)
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Title not available (Why is that?)
- On t-distance sets of (0,+-1)-vectors
- On large vector systems with equal scalar products
Cited In (7)
- Problems from CGCS Luminy, May 2007
- Inside s-inner product sets and Euclidean designs
- On the strong non-rigidity of certain tight Euclidean designs
- Cubature formulas in numerical analysis and Euclidean tight designs
- A survey on spherical designs and algebraic combinatorics on spheres
- A Helly type theorem for hypersurfaces
- Binary scalar products
This page was built for publication: Bounds on the Maximum Number of Vectors with given Scalar Products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784099)
