English
Related papers

Related papers: Equiangular lines in low dimensional Euclidean spa…

200 papers

Linear codes in the projective space $\mathbb{P}_q(n)$, the set of all subspaces of the vector space $\mathbb{F}_q^n$, were first considered by Braun, Etzion and Vardy. The Grassmannian $\mathbb{G}_q(n,k)$ is the collection of all subspaces…

Information Theory · Computer Science 2021-07-23 Pranab Basu

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

Metric Geometry · Mathematics 2020-07-08 Atte Lohvansuu

Dimension-varying linear systems are investigated. First, a dimension-free state space is proposed. A cross dimensional distance is constructed to glue vectors of different dimensions together to form a cross-dimensional topological space.…

Dynamical Systems · Mathematics 2019-04-17 Daizhan Cheng , Zhenhui Xu , Tielong Shen

In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension…

Information Theory · Computer Science 2013-01-10 Anna-Lena Trautmann

We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…

Number Theory · Mathematics 2021-09-27 Laia Amorós , M. Taoufiq Damir , Camilla Hollanti

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

Information Theory · Computer Science 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan

The relation between equiangular sets of lines in the real space and distance-regular double covers of the complete graph is well known and studied since the work of Seidel and others in the 70's. The main topic of this paper is to continue…

Combinatorics · Mathematics 2018-05-23 Gabriel Coutinho , Chris Godsil , Mirhamed Shirazi , Harmony Zhan

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

Metric Geometry · Mathematics 2012-03-14 J. Konarzewski , M. Żynel

The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…

Optimization and Control · Mathematics 2019-11-07 Hans D. Mittelmann , Frank Vallentin

We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.

Combinatorics · Mathematics 2008-05-19 Nicolas Bartholdi , Jérémy Blanc , Sébastien Loisel

We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works by Barg-Musin and Musin-Nozaki. As our main result, we find…

Combinatorics · Mathematics 2022-07-08 Alexander Barg , Ching-Yi Lai , Pin-Chieh Tseng , Wei-Hsuan Yu

We show that much of the theory of finite tight frames can be generalised to vector spaces over the quaternions. This includes the variational characterisation, group frames, and the characterisations of projective and unitary equivalence.…

Functional Analysis · Mathematics 2025-08-29 Shayne Waldron

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

Information Theory · Computer Science 2019-10-17 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

Number Theory · Mathematics 2024-03-15 Jacques Martinet

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

The lower bound for the chromatic number of the Euclidean space of dimension 8 is increased to 25.

Combinatorics · Mathematics 2026-03-17 Jaan Parts

We improve the best lower bounds on the chromatic number of Euclidean space in small dimensions. The new results depend on extensive computations in Sage.

Combinatorics · Mathematics 2014-09-05 Matthew Kahle , Birra Taha

We estimate the number of lines on a non-K3 quartic surface. Such a surface with only isolated double point(s) contains at most twenty lines; this bound is attained by a unique configuration of lines and by a surface with a certain limited…

Algebraic Geometry · Mathematics 2025-07-01 Alex Degtyarev , Sławomir Rams

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…

Combinatorics · Mathematics 2024-10-30 Gabriela Araujo-Pardo , Martín Matamala , Juan P. Peña , José Zamora

In complex vector spaces maximal sets of equiangular lines, known as SICs, are related to real quadratic number fields in a dimension dependent way. If the dimension is of the form $n^2+3$ the base field has a fundamental unit of negative…

Quantum Physics · Physics 2020-05-29 Ingemar Bengtsson
‹ Prev 1 3 4 5 6 7 10 Next ›