Every large set of equidistant (0,+1,-1)-vectors forms a sunflower

DOI10.1007/BF02579328zbMath0491.05045WikidataQ29040303 ScholiaQ29040303MaRDI QIDQ1167186

Michel Marie Deza, Peter Frankl

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

projective planeequidistant code(0,+1,-1)-vectors(0,1)code

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25)

Related Items

Pseudo sunflowers, Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors, A note on equidistant subspace codes, On restricted intersections and the sunflower problem, Equidistant subspace codes, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Galois geometries and coding theory, On large vector systems with equal scalar products, Unavoidable hypergraphs, An exact result for \((0, \pm 1)\)-vectors, Improved bounds for the sunflower lemma, Bounds on the Maximum Number of Vectors with given Scalar Products, Equidistant codes in the Grassmannian

Cites Work

• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• A theorem on equidistant codes
• Spherical codes and designs
• Metric Spaces and Positive Definite Functions
• Unnamed Item