Author:
Ganzhinov Mikhail,Szöllősi Ferenc
Abstract
AbstractLine 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)$$
2
(
d
-
1
)
(
d
-
2
)
, and this result is sharp for $$d\in \{4,5,6\}$$
d
∈
{
4
,
5
,
6
}
. Connections to binary codes, few-distance sets, and association schemes are explored, along with their multiangular generalization.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference45 articles.
1. Abbott, J., Bigatti, A.M.: CoCoALib: a C++ library for doing Computations in Commutative Algebra. http://cocoa.dima.unige.it/cocoalib, ver. 0.99560 (2019)
2. Bachoc, Ch., Vallentin, F.: Optimality and uniqueness of the $$(4,10,1/6)$$ spherical code. J. Combin. Theory Ser. A 116(1), 195–204 (2009)
3. Balla, I., Dräxler, F., Keevash, P., Sudakov, B.: Equiangular lines and spherical codes in Euclidean space. Invent. Math. 211(1), 179–212 (2018)
4. Bannai, Ei., Bannai, Et.: A survey on spherical designs and algebraic combinatorics on spheres. European J. Combin. 30(6), 1392–1425 (2009)
5. Bannai, Ei., Bannai, Et., Stanton, D.: An upper bound for the cardinality of an $$s$$-distance subset in real Euclidean space, II. Combinatorica 3(2), 147–152 (1983)