Equiangular Tight Frames From Hyperovals
From MaRDI portal
Abstract: An equiangular tight frame (ETF) is a set of equal norm vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-bound-equality sequences, such frames arise in various applications, such as waveform design, quantum information theory, compressed sensing and algebraic coding theory. ETFs seem to be rare, and only a few methods of constructing them are known. In this paper, we present a new infinite family of complex ETFs that arises from hyperovals in finite projective planes. In particular, we give the first ever construction of a complex ETF of 76 vectors in a space of dimension 19. Recently, a computer-assisted approach was used to show that real ETFs of this size do not exist, resolving a longstanding open problem in this field. Our construction is a modification of a previously known technique for constructing ETFs from balanced incomplete block designs.
Cited in
(51)- Upper bounds for \(s\)-distance sets and equiangular lines
- Equiangular tight frames that contain regular simplices
- Frames of uniform subframe bounds with applications to erasures
- Nearly optimal codebooks based on generalized Jacobi sums
- Frame multiplication theory and a vector-valued DFT and ambiguity function
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Two constructions of asymptotically optimal codebooks via the trace functions
- Geometric properties of SIC-POVM tensor square
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- Neural collapse with unconstrained features
- Infinite families of optimal systems of biangular lines related to representations of \(\mathrm{SL}(2, \mathbb{F}_q)\)
- On the value of the fifth maximal projection constant
- Saturated configuration and new large construction of equiangular lines
- Generalized asymptotically optimal codebooks
- Six constructions of asymptotically optimal codebooks via the character sums
- Grassmannian codes from paired difference sets
- The Lemmens-Seidel conjecture and forbidden subgraphs
- Doubly transitive lines. I: Higman pairs and roux
- Equiangular lines and the Lemmens-Seidel conjecture
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Harmonic equiangular tight frames comprised of regular simplices
- Two constructions of asymptotically optimal codebooks
- Polyphase equiangular tight frames and abelian generalized quadrangles
- Equiangular tight frames from group divisible designs
- Equiangular tight frames with simplices and with full spark in \(\mathbb{R}^d\)
- Hadamard equiangular tight frames
- Kesten-McKay law for random subensembles of Paley equiangular tight frames
- Frames over finite fields: basic theory and equiangular lines in unitary geometry
- A Short Introduction to Optimal Line Packings
- Dimension towers of SICs. I: Aligned SICs and embedded tight frames
- Constructions of biangular tight frames and their relationships with equiangular tight frames
- Packings in real projective spaces
- Tight frames and related geometric problems
- Equiangular Frames and Their Duals
- Optimal arrangements of classical and quantum states with limited purity
- OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
- Learning overcomplete, low coherence dictionaries with linear inference
- New constructions of codebooks nearly meeting the Welch bound
- The core of a Grassmannian frame
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Hermitian matrices of roots of unity and their characteristic polynomials
- DCACO: an algorithm for designing incoherent redundant matrices
- On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns
- Three constructions of asymptotically optimal codebooks via multiplicative characters of finite fields
- Testing isomorphism between tuples of subspaces
- On the optimal arrangement of \(2d\) lines in \(\mathbb{C}^d\)
- Two classes of asymptotically optimal codebooks based on hybrid character sums
- Doubly transitive equiangular tight frames that contain regular simplices
- Mini-workshop: Algebraic, geometric, and combinatorial methods in frame theory. Abstracts from the mini-workshop held September 30 -- October 6, 2018
- Regular two-distance sets
This page was built for publication: Equiangular Tight Frames From Hyperovals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976650)
