Biangular Lines Revisited

Mikhail Ganzhinov; Ferenc Szöllősi

doi:10.1007/s00454-021-00276-6

Biangular Lines Revisited

Mikhail Ganzhinov^*, Ferenc Szöllősi

^*Tämän työn vastaava kirjoittaja

Information Theory

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

49 Lataukset (Pure)

Abstrakti

Line systems passing through the origin of the d-dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least 2(d - 1)(d - 2), and this result is sharp for d is an element of{4, 5, 6}. Connections to binary codes, few-distance sets, and association schemes are explored, along with their multiangular generalization.

Alkuperäiskieli	Englanti
Sivut	1113-1142
Sivumäärä	30
Julkaisu	Discrete and Computational Geometry
Vuosikerta	66
Numero	3
Varhainen verkossa julkaisun päivämäärä	2021
DOI - pysyväislinkit	https://doi.org/10.1007/s00454-021-00276-6
Tila	Julkaistu - lokak. 2021
OKM-julkaisutyyppi	A1 Julkaistu artikkeli, soviteltu

Pääsy asiakirjaan

10.1007/s00454-021-00276-6Lisenssi: CC BY

Ganzhinov2021_Article_BiangularLinesRevisited CopyFinal published version, 373 KBLisenssi: CC BY

OpenUrl-saatavuus

Koko teksti

Muut tiedostot ja linkit

Linkki julkaisuun Scopuksessa

Konstruktion och klassificering av diskreta matematiska strukturer
Kokkala, J., Laaksonen, A., Östergård, P., Szollosi, F., Pöllänen, A., Heinlein, D. & Ganzhinov, M.
01/09/2015 → 31/08/2019
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@article{e8e1c97223e54219a704b1c0240cf8cb,

title = "Biangular Lines Revisited",

abstract = "Line systems passing through the origin of the d-dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least 2(d - 1)(d - 2), and this result is sharp for d is an element of{4, 5, 6}. Connections to binary codes, few-distance sets, and association schemes are explored, along with their multiangular generalization.",

keywords = "Biangular lines, Few-distance sets, t-Designs",

author = "Mikhail Ganzhinov and Ferenc Sz{\"o}ll{\H o}si",

note = "Funding Information: This research was supported in part by the Academy of Finland, Grant #289002. Publisher Copyright: {\textcopyright} 2021, The Author(s). Copyright: Copyright 2021 Elsevier B.V., All rights reserved.",

year = "2021",

month = oct,

doi = "10.1007/s00454-021-00276-6",

language = "English",

volume = "66",

pages = "1113--1142",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "SPRINGER",

number = "3",

}

TY - JOUR

T1 - Biangular Lines Revisited

AU - Ganzhinov, Mikhail

AU - Szöllősi, Ferenc

N1 - Funding Information: This research was supported in part by the Academy of Finland, Grant #289002. Publisher Copyright: © 2021, The Author(s). Copyright: Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021/10

Y1 - 2021/10

N2 - Line systems passing through the origin of the d-dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least 2(d - 1)(d - 2), and this result is sharp for d is an element of{4, 5, 6}. Connections to binary codes, few-distance sets, and association schemes are explored, along with their multiangular generalization.

AB - Line systems passing through the origin of the d-dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least 2(d - 1)(d - 2), and this result is sharp for d is an element of{4, 5, 6}. Connections to binary codes, few-distance sets, and association schemes are explored, along with their multiangular generalization.

KW - Biangular lines

KW - Few-distance sets

KW - t-Designs

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

U2 - 10.1007/s00454-021-00276-6

DO - 10.1007/s00454-021-00276-6

M3 - Article

AN - SCOPUS:85103622982

SN - 0179-5376

VL - 66

SP - 1113

EP - 1142

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 3

ER -

Biangular Lines Revisited

Abstrakti

Pääsy asiakirjaan

OpenUrl-saatavuus

Muut tiedostot ja linkit

Sormenjälki

Projektit

Konstruktion och klassificering av diskreta matematiska strukturer

Siteeraa tätä