English
Related papers

Related papers: A simple construction of complex equiangular lines

200 papers

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

Combinatorics · Mathematics 2025-07-16 Boris Bukh , Aleksandre Saatashvili

An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. They are often represented as the columns of a short, fat matrix. In certain applications we want this matrix to be flat, that is, have the property…

Functional Analysis · Mathematics 2017-03-17 Matthew Fickus , John Jasper , Dustin G. Mixon , Jesse D. Peterson

Minimum resolution set and associated metric dimension provide the basis for unique and systematic labeling of nodes of a graph using distances to a set of landmarks. Such a distance vector set, however, may not be unique to the graph and…

Discrete Mathematics · Computer Science 2023-12-05 Gunjan S. Mahindre , Anura P. Jayasumana

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

Combinatorics · Mathematics 2019-07-22 Coen del Valle , Peter J. Dukes

An arc is a set of vectors of the $k$-dimensional vector space over the finite field with $q$ elements ${\mathbb F}_q$, in which every subset of size $k$ is a basis of the space, i.e. every $k$-subset is a set of linearly independent…

Combinatorics · Mathematics 2016-05-27 Simeon Ball

The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…

Functional Analysis · Mathematics 2016-07-18 Bernhard G. Bodmann , John I. Haas

We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size…

Combinatorics · Mathematics 2024-02-22 Ivan Landjev , Konstantin Vorob'ev

In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…

Functional Analysis · Mathematics 2011-04-19 Ferenc Szöllősi

We construct a quasiconformal mapping of $n$-dimensional Euclidean space, $n \geq 2$, that simultaneously distorts the Hausdorff dimension of a nearly maximal collection of parallel lines by a given amount. This answers a question of…

Metric Geometry · Mathematics 2016-01-28 Zoltán M. Balogh , Jeremy T. Tyson , Kevin Wildrick

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Combinatorics · Mathematics 2012-04-24 Ferenc Szöllősi

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

This paper introduces and investigates a novel class of skew-regular Quaternary Hadamard matrices. For every odd prime power $p$, we establish the existence of these matrices for all orders $1+p^2$, each characterized by a constant row sum…

Combinatorics · Mathematics 2026-03-31 Hadi Kharaghani , Vlad Zaitsev

A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in…

Combinatorics · Mathematics 2026-02-02 Aidan Bennett , Curtis Bright , Paul Colinot , Ashwin Nayak

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

Combinatorics · Mathematics 2021-11-04 Patrick Browne , Ronan Egan , Fintan Hegarty , Padraig O Cathain

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

Algebraic number theory relates SIC-POVMs in dimension $d>3$ to those in dimension $d(d-2)$. We define a SIC in dimension $d(d-2)$ to be aligned to a SIC in dimension $d$ if and only if the squares of the overlap phases in dimension $d$…

Quantum Physics · Physics 2018-03-01 Marcus Appleby , Ingemar Bengtsson , Irina Dumitru , Steven Flammia

We study the problem of determining the maximum size of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Let $N_{\alpha,\beta}(d)$ denote the maximum number of unit vectors in $\mathbb R^d$…

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

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

Computational Geometry · Computer Science 2025-08-22 Sanjeev Saxena

Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix…

Statistical Mechanics · Physics 2026-05-08 Pasquale Casaburi , Pierpaolo Vivo

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Numerical Analysis · Mathematics 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan
‹ Prev 1 4 5 6 7 8 10 Next ›