Sets of vectors with many orthogonal paris

Z. Füredi, Richard Stanley

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

What is the most number of vectors in Rd such that any k+1 contain an orthogonal pair? The 24 positive roots of the root system F4 in R4 show that this number could exceed dk.

Original languageEnglish
Pages (from-to)391-394
Number of pages4
JournalGraphs and Combinatorics
Volume8
Issue number4
DOIs
Publication statusPublished - Dec 1992

Fingerprint

Set of vectors
Root System
Exceed
Roots

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Sets of vectors with many orthogonal paris. / Füredi, Z.; Stanley, Richard.

In: Graphs and Combinatorics, Vol. 8, No. 4, 12.1992, p. 391-394.

Research output: Contribution to journalArticle

Füredi, Z. ; Stanley, Richard. / Sets of vectors with many orthogonal paris. In: Graphs and Combinatorics. 1992 ; Vol. 8, No. 4. pp. 391-394.
@article{0c8a930ce20f452db60c940c5009cc47,
title = "Sets of vectors with many orthogonal paris",
abstract = "What is the most number of vectors in Rd such that any k+1 contain an orthogonal pair? The 24 positive roots of the root system F4 in R4 show that this number could exceed dk.",
author = "Z. F{\"u}redi and Richard Stanley",
year = "1992",
month = "12",
doi = "10.1007/BF02351595",
language = "English",
volume = "8",
pages = "391--394",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "4",

}

TY - JOUR

T1 - Sets of vectors with many orthogonal paris

AU - Füredi, Z.

AU - Stanley, Richard

PY - 1992/12

Y1 - 1992/12

N2 - What is the most number of vectors in Rd such that any k+1 contain an orthogonal pair? The 24 positive roots of the root system F4 in R4 show that this number could exceed dk.

AB - What is the most number of vectors in Rd such that any k+1 contain an orthogonal pair? The 24 positive roots of the root system F4 in R4 show that this number could exceed dk.

UR - http://www.scopus.com/inward/record.url?scp=0346122053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346122053&partnerID=8YFLogxK

U2 - 10.1007/BF02351595

DO - 10.1007/BF02351595

M3 - Article

VL - 8

SP - 391

EP - 394

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 4

ER -