English
Related papers

Related papers: Equiangular lines, Incoherent sets and Quasi-symme…

200 papers

A set of lines in $\mathbb{R}^d$ passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-point semidefinite constraints developed by Bachoc and…

Combinatorics · Mathematics 2022-03-14 Wei-Jiun Kao , Wei-Hsuan Yu

A set of lines through the origin in Euclidean space is called equiangular when any pair of lines from the set intersects with each other at a common angle. We study the maximum size of equiangular lines in Euclidean space and use graph…

Combinatorics · Mathematics 2018-10-16 Yen-chi Roger Lin , Wei-Hsuan Yu

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming…

Metric Geometry · Mathematics 2014-05-27 Alexander Barg , Wei-Hsuan Yu

A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is conjectured that…

Combinatorics · Mathematics 2015-01-13 Jonathan Jedwab , Amy Wiebe

We obtain several new results contributing to the theory of real equiangular line systems. Among other things, we present a new general lower bound on the maximum number of equiangular lines in d dimensional Euclidean space; we describe the…

Combinatorics · Mathematics 2016-05-03 G. Greaves , J. H. Koolen , A. Munemasa , F. Szöllősi

We determine the maximum number $N_\alpha(d)$ of equiangular lines with fixed angle $\arccos\alpha$ for $\alpha = 1/(1+2\sqrt2)$ in $d$-dimensional Euclidean space: $2,3,4,6,8,10,14,15,16,17,18,20,22$ for $d \in \{2,\dots,14\}$, and…

Combinatorics · Mathematics 2026-03-04 Theodore Gossett , Zilin Jiang , Adam Teets , Zoe Wellner

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…

Combinatorics · Mathematics 2018-05-28 Emily J. King , Xiaoxian Tang

Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. Fix $0 < \alpha < 1$. Let…

Combinatorics · Mathematics 2022-03-01 Zilin Jiang , Jonathan Tidor , Yuan Yao , Shengtong Zhang , Yufei Zhao

I introduce the problem of finding maximal sets of equiangular lines, in both its real and complex versions, attempting to write the treatment that I would have wanted when I first encountered the subject. Equiangular lines intersect in the…

Quantum Physics · Physics 2020-09-01 Blake C. Stacey

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Metric Geometry · Mathematics 2007-05-23 Konrad J Swanepoel

A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the Hermitian inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is…

Combinatorics · Mathematics 2015-03-23 Jonathan Jedwab , Amy Wiebe

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…

Combinatorics · Mathematics 2017-06-30 Igor Balla , Felix Dräxler , Peter Keevash , Benny Sudakov

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

Combinatorics · Mathematics 2019-08-30 Yen-chi Roger Lin , Wei-Hsuan Yu

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…

Combinatorics · Mathematics 2013-06-06 Aidan Roy

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We derive new upper bounds on the cardinality of equiangular lines. Let us denote the maximum cardinality of equiangular lines in…

Metric Geometry · Mathematics 2016-09-06 Wei-Hsuan Yu

We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…

Metric Geometry · Mathematics 2023-12-18 Kean Fallon , Joseph W. Iverson

In 2023, Greaves et~al.\ constructed several sets of 57 equiangular lines in dimension 18. Using the concept of switching root introduced by Cao et~al.\ in 2021, these sets of equiangular lines are embedded in a lattice of rank 19 spanned…

Combinatorics · Mathematics 2025-06-30 Yen-chi Roger Lin , Akihiro Munemasa , Tetsuji Taniguchi , Kiyoto Yoshino

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…

Metric Geometry · Mathematics 2019-10-15 Mikhail Ganzhinov , Ferenc Szöllősi

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

Number Theory · Mathematics 2019-06-25 Michael Baake , Rudolf Scharlau , Peter Zeiner
‹ Prev 1 2 3 10 Next ›