Related papers: Equiangular tight frames from group divisible desi…
We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum…
The kinematics of many mechanical systems encountered in robotics and other fields, such as single-bearing attitude estimation and SLAM, are naturally posed on homogeneous spaces: That is, their state lies in a smooth manifold equipped with…
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…
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…
Hilbert space frames generalize orthonormal bases to allow redundancy in representations of vectors while keeping good reconstruction properties. A frame comes with an associated frame operator encoding essential properties of the frame. We…
We use group schemes to construct optimal packings of lines through the origin. In this setting, optimal line packings are naturally characterized using representation theory, which in turn leads to a necessary integrality condition for the…
Equivariant Graph Neural Networks (eGNNs) trained on density-functional theory (DFT) data can potentially perform electronic structure prediction at unprecedented scales, enabling investigation of the electronic properties of materials with…
Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…
We introduce the $\star_G$ tensor algebra, in which any finite group $G$ defines the multiplication rule, making equivariance an intrinsic algebraic property rather than an architectural constraint. The framework rests on three…
Every equi-isoclinic tight fusion frame (EITFF) is a type of optimal code in a Grassmannian, consisting of subspaces of a finite-dimensional Hilbert space for which the smallest principal angle between any pair of them is as large as…
Let $F$ be a finite extension of $\mathbb{Q}_p$, let $\Omega_F$ be Drinfeld's upper half-plane over $F$ and let $G^0$ the subgroup of $GL_2(F)$ consisting of elements whose determinant has norm $1$. By working locally on $\Omega_F$, we…
We derive easily verifiable conditions which characterize when complex Seidel matrices containing cube roots of unity have exactly two eigenvalues. The existence of such matrices is equivalent to the existence of equiangular tight frames…
Equivariant Graph Neural Networks (GNNs) have significantly advanced the modeling of 3D molecular structure by leveraging group representations. However, their message passing, heavily relying on Clebsch-Gordan tensor product convolutions,…
We introduce probabilistic frames to study finite frames whose elements are chosen at random. While finite tight frames generalize orthonormal bases by allowing redundancy, independent, uniformly distributed points on the sphere…
Generalized Category Discovery (GCD) focuses on classifying known categories while simultaneously discovering novel categories from unlabeled data. However, previous GCD methods face challenges due to inconsistent optimization objectives…
We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…
Higher order tensor inversion is possible for even order. We have shown that a tensor group endowed with the Einstein (contracted) product is isomorphic to the general linear group of degree $n$. With the isomorphic group structures, we…
Message-passing neural networks (MPNNs) are the leading architecture for deep learning on graph-structured data, in large part due to their simplicity and scalability. Unfortunately, it was shown that these architectures are limited in…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…