Equiangular Subspaces in Euclidean Spaces

Igor Balla; Benny Sudakov

doi:10.1007/s00454-018-9972-5

Equiangular Subspaces in Euclidean Spaces

Igor Balla, Benny Sudakov^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in R ⁿ was studied extensively for the last 70 years. In this paper, we study analogous questions for k-dimensional subspaces. We discuss natural ways of defining the angle between k-dimensional subspaces and correspondingly study the maximum size of an equiangular set of k-dimensional subspaces in R ⁿ . Our bounds extend and improve a result of Blokhuis.

Original language	English
Pages (from-to)	81-90
Number of pages	10
Journal	Discrete and Computational Geometry
Volume	61
Issue number	1
DOIs	https://doi.org/10.1007/s00454-018-9972-5
State	Published - 15 Jan 2019
Externally published	Yes

Keywords

Equiangular lines
Grassmannian
Polynomial method
Principal angles
Subspaces

Access to Document

10.1007/s00454-018-9972-5

Cite this

@article{a2fbcd42eecf4c289395bd3d977ecc30,

title = "Equiangular Subspaces in Euclidean Spaces",

abstract = " A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in R n was studied extensively for the last 70 years. In this paper, we study analogous questions for k-dimensional subspaces. We discuss natural ways of defining the angle between k-dimensional subspaces and correspondingly study the maximum size of an equiangular set of k-dimensional subspaces in R n . Our bounds extend and improve a result of Blokhuis.",

keywords = "Equiangular lines, Grassmannian, Polynomial method, Principal angles, Subspaces",

author = "Igor Balla and Benny Sudakov",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = jan,

day = "15",

doi = "10.1007/s00454-018-9972-5",

language = "אנגלית",

volume = "61",

pages = "81--90",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Equiangular Subspaces in Euclidean Spaces

AU - Balla, Igor

AU - Sudakov, Benny

PY - 2019/1/15

Y1 - 2019/1/15

N2 - A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in R n was studied extensively for the last 70 years. In this paper, we study analogous questions for k-dimensional subspaces. We discuss natural ways of defining the angle between k-dimensional subspaces and correspondingly study the maximum size of an equiangular set of k-dimensional subspaces in R n . Our bounds extend and improve a result of Blokhuis.

AB - A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in R n was studied extensively for the last 70 years. In this paper, we study analogous questions for k-dimensional subspaces. We discuss natural ways of defining the angle between k-dimensional subspaces and correspondingly study the maximum size of an equiangular set of k-dimensional subspaces in R n . Our bounds extend and improve a result of Blokhuis.

KW - Equiangular lines

KW - Grassmannian

KW - Polynomial method

KW - Principal angles

KW - Subspaces

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

U2 - 10.1007/s00454-018-9972-5

DO - 10.1007/s00454-018-9972-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85045045733

SN - 0179-5376

VL - 61

SP - 81

EP - 90

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

Equiangular Subspaces in Euclidean Spaces

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this