相关论文: Grassmannian Frames with Applications to Coding an…
I briefly argue for logical necessity to incorporate, besides c, hbar, two fundamental length scales in the symmetries associated with the interface of gravitational and quantum realms. Next, in order to clear the proverbial bush, I discuss…
In the last few years, the methods of constructive Fermionic Renormalization Group have been successfully applied to the study of the scaling limit of several two-dimensional statistical mechanics models at the critical point, including:…
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…
The Grassmannian space $\Gr$ is the set of all $k-$dimensional subspaces of the vector space~\smash{$\F_q^n$}. Recently, codes in the Grassmannian have found an application in network coding. The main goal of this paper is to present…
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.…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
Tracking signals in dynamic environments presents difficulties in both analysis and implementation. In this work, we expand on a class of subspace tracking algorithms which utilize the Grassmann manifold -- the set of linear subspaces of a…
This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results…
We study four-dimensional gauge theories coupled to fermions in the fundamental and meson-like scalars. All requisite beta functions are provided for general gauge group and fermion representation. In the regime where asymptotic freedom is…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
Subspace learning and matrix factorization problems have great many applications in science and engineering, and efficient algorithms are critical as dataset sizes continue to grow. Many relevant problem formulations are non-convex, and in…
We extend many known results for harmonic maps from the 2-sphere into a Grassmannian to harmonic maps of finite uniton number from an arbitrary Riemann surface. Our method relies on a new theory of nilpotent cycles arising from the diagrams…
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
This paper advocates a novel framework for segmenting a dataset in a Riemannian manifold $M$ into clusters lying around low-dimensional submanifolds of $M$. Important examples of $M$, for which the proposed clustering algorithm is…
Wireless connectivity creates a computing paradigm that merges communication and inference. A basic operation in this paradigm is the one where a device offloads classification tasks to the edge servers. We term this remote classification,…
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been…
Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of $\F_q^n$ with a given dimension. In this paper, we consider the problem of list decoding of a certain…
Minimal parametrization of 3D lines plays a critical role in camera localization and structural mapping. Existing representations in robotics and computer vision predominantly handle independent lines, overlooking structural regularities…
In this paper, we study the Grassmannian of n-dimensional subspaces of a 2n-dimensional vector space and its infinite-dimensional analogues. Such a Grassmannian can be endowed with two binary relations (adjacent and distant), with pencils…
Bodmann, Casazza and Kutyniok introduced a quantitative notion of redundancy for finite frames - which they called {\em upper and lower redundancies} - that match better with an intuitive understanding of redundancy for finite frames in a…