Related papers: Grassmannian Frames with Applications to Coding an…
Consider the point line-geometry ${\mathcal P}_t(n,k)$ having as points all the $[n,k]$-linear codes having minimum dual distance at least $t+1$ and where two points $X$ and $Y$ are collinear whenever $X\cap Y$ is a $[n,k-1]$-linear code…
This paper gives a survey of methods for the construction of space-frequency concentrated frames on Riemannian manifolds with bounded curvature, and the applications of these frames to the analysis of function spaces. In this general…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
We introduce a unified framework, formulated as general latent space models, to study complex higher-order network interactions among multiple entities. Our framework covers several popular models in recent network analysis literature,…
In frame theory literature, there are several generalizations of frame, K-fusion frame presents a flavour of one such generalization, basically it is an intertwined replica of K-frame and fusion frame. K-fusion frames come naturally (having…
We study fermionic conformal field theories on surfaces with spin structure in the presence of boundaries, defects, and interfaces. We obtain the relevant crossing relations, taking particular care with parity signs and signs arising from…
The foundation model has heralded a new era in artificial intelligence, pretraining a single model to offer cross-domain transferability on different datasets. Graph neural networks excel at learning graph data, the omnipresent…
Tight frames and rank-one quantum measurements are shown to be intimately related. In fact, the family of normalized tight frames for the space in which a quantum mechanical system lies is precisely the family of rank-one generalized…
Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…
We develop a new, more functorial construction for the basic theory of limit linear series, which provides a compactification of the Eisenbud-Harris theory, and shows promise for generalization to higher-dimensional varieties and…
In this paper, we settle a long-standing problem on the connectivity of spaces of finite unit norm tight frames (FUNTFs), essentially affirming a conjecture first appearing in [Dykema and Strawn, 2003]. Our central technique involves…
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…
In the recent past, nested structures in Riemannian manifolds has been studied in the context of dimensionality reduction as an alternative to the popular principal geodesic analysis (PGA) technique, for example, the principal nested…
In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…
Collections of time- and frequency-shifts of suitably chosen generators (Alltop or random vectors) proved successful for many applications in sparse recovery and related fields. It was shown in \cite{xia2005achieving} that taking a…
Let $X=\{x_i\}_{i=1}^m$ be a set of unit vectors in $\RR^n$. The coherence of $X$ is $\coh(X):=\max_{i\not=j}|\langle x_i, x_j\rangle|$. A vector $x\in X$ is said to be isolable if there are no unit vectors $x'$ arbitrarily close to $x$…
We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…
The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…
Graph Neural Networks (GNNs) have received considerable attention on graph-structured data learning for a wide variety of tasks. The well-designed propagation mechanism which has been demonstrated effective is the most fundamental part of…
Codes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in…