English
Related papers

Related papers: Equiangular tight frames with centroidal symmetry

200 papers

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

This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of…

Functional Analysis · Mathematics 2013-03-26 Bernhard G. Bodmann

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

Combinatorics · Mathematics 2025-06-26 João Gouveia , Stefan Steinerberger , Rekha R. Thomas

We will show that tight frames satisfying the restricted isometry property give rise to nearly tight fusion frames which are nearly orthogonal and hence are nearly equi-isoclinic. We will also show how to replace parts of the RIP frame with…

Functional Analysis · Mathematics 2011-12-02 Bernhard Bodmann , Jameson Cahill , Peter G. Casazza

We study twisted derived equivalences for schemes in the setting of spectral algebraic geometry. To this end, we introduce the notion of a twisted equivalence and show that a twisted equivalence for perfect spectral algebraic stacks…

Algebraic Geometry · Mathematics 2021-09-08 Chang-Yeon Chough

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

Classical Analysis and ODEs · Mathematics 2017-08-22 N. Chatzikonstantinou , A. Iosevich , S. Mkrtchyan , J. Pakianathan

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant

Configurations of subspaces like equichordal and equiisoclinic tight fusion frames, which are in some sense optimally spread apart and which also have reconstruction properties emulating those of orthonormal bases, are useful in various…

Functional Analysis · Mathematics 2021-05-10 Emily J. King

In teleparallel geometries the coframe and corresponding spin-connection are the principal geometric objects and consequently the appropriate definition of a symmetry is that of an affine symmetry. The set of invariant coframes and their…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Alan A. Coley , Alexandre Landry , Fateme Gholami

An equichordal tight fusion frame (ECTFF) is a finite sequence of equi-dimensional subspaces of a finite-dimensional Hilbert space that achieves equality in Conway, Hardin and Sloane's simplex bound. Every ECTFF is a type of optimal…

Functional Analysis · Mathematics 2021-03-05 Matthew Fickus , Benjamin R. Mayo , Cody E. Watson

The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability,…

Functional Analysis · Mathematics 2012-02-24 Afonso S. Bandeira , Matthew Fickus , Dustin G. Mixon , Percy Wong

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…

Combinatorics · Mathematics 2020-09-04 Martin Winter

We present a brief structural equivalence between the symmetric TSP and a constrained Group Steiner Tree Problem (cGSTP) defined on a simplicial incidence graph. Given the complete weighted graph on the city set V, we form the bipartite…

Data Structures and Algorithms · Computer Science 2026-02-06 Yılmaz Arslanoğlu

In teleparallel gravity and, in particular, in $F(T)$ teleparallel gravity, there is a challenge in determining an appropriate (co-)frame and its corresponding spin connection to describe the geometry. Very often, the "proper" frame, the…

General Relativity and Quantum Cosmology · Physics 2022-11-17 A. A. Coley , R. J. van den Hoogen , D. D. McNutt

Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs…

Combinatorics · Mathematics 2021-01-22 Veronika Furst , Howard Grotts

We study the rigidity properties of Grassmannian frames: basis-like sets of unit vectors that correspond to optimal Grassmannian line packings. It is known that Grassmannian frames characterized by the Welch bound must satisfy the…

Functional Analysis · Mathematics 2017-02-21 Peter G. Casazza , John I. Haas

The concept of balancedly splittable orthogonal designs is introduced along with a recursive construction. As an application, equiangular tight frames over the real, complex, and quaternions meeting the Delsarte-Goethals-Seidel upper bound…

Combinatorics · Mathematics 2023-12-06 Hadi Kharaghani , Thomas Pender , Sho Suda

A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…

Combinatorics · Mathematics 2026-05-15 Andrew Niu

Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…

Functional Analysis · Mathematics 2012-07-10 Maria Charina , Mihai Putinar , Claus Scheiderer , Joachim Stoeckler

The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…

Combinatorics · Mathematics 2025-09-09 Tito Augusto Cuchilla , Joseph Hound , Cole Plepel , Andrés R. Vindas-Meléndez , Louis Ye