Related papers: Unequal dimensional small balls and quantization o…
Classical mechanics, in the operatorial formulation of Koopman and von Neumann, can be written also in a functional form. In this form two Grassmann partners of time make their natural appearance extending in this manner time to a three…
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…
On the Grassmann manifold G (m, n) of m-dimensional subspaces of an n-dimensional projective space P^n, a certain supplementary construction called the normalization is considered. By means of this normalization, one can construct the…
Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…
Recent results in quantization theory show that the mean-squared expected distortion can reach a rate of convergence of $\mathcal{O}(1/n)$, where $n$ is the sample size [see, e.g., IEEE Trans. Inform. Theory 60 (2014) 7279-7292 or Electron.…
New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…
Quantum states defined over a parameter space form a Grassmann manifold. To capture the geometry of the associated gauge structure, gauge-invariant quantities are essential. We employ the projector of a multilevel system to quantify the…
If $(M^n, g)$ is a closed Riemannian manifold where every unit ball has volume at most $\epsilon_n$ (a sufficiently small constant), then the $(n-1)$-dimensional Uryson width of $(M^n, g)$ is at most 1.
In the construction of spectral manifolds in noncommutative geometry, a higher degree Heisenberg commutation relation involving the Dirac operator and the Feynman slash of real scalar fields naturally appears and implies, by equality with…
We introduce a universal quantization scheme based on random coding, and we analyze its performance. This scheme consists of a source-independent random codebook (typically_mismatched_ to the source distribution), followed by optimal…
In image set classification, a considerable progress has been made by representing original image sets on Grassmann manifolds. In order to extend the advantages of the Euclidean based dimensionality reduction methods to the Grassmann…
It was shown by E. Gluskin and V.D. Milman in [GAFA Lecture Notes in Math. 1807, 2003] that the classical arithmetic-geometric mean inequality can be reversed (up to a multiplicative constant) with high probability, when applied to…
There is a hierarchy of commuting soliton equations associated to each symmetric space U/K. When U/K has rank n, the first n flows in the hierarchy give rise to a natural first order non-linear system of partial diffferential equations in n…
We prove a large deviations principle for orthogonal projections of the unit ball $\mathbb{B}_p^n$ of $\ell_p^n$ onto a random $k$-dimensional linear subspace of $\mathbb{R}^n$ as $n\to\infty$ in the case $2<p\le \infty$ and for the…
Determining the ultimate limits of quantum communication, such as the quantum capacity of a channel and the distillable entanglement of a shared state, remains a central challenge in quantum information theory, primarily due to the…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch\"{o}nheim bound is the best known lower bound on the size of a covering code in…
Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…
Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…
The Gromov-Wasserstein (GW) framework adapts ideas from optimal transport to allow for the comparison of probability distributions defined on different metric spaces. Scalable computation of GW distances and associated matchings on graphs…