Related papers: Tight Frame with Hahn and Krawtchouk Polynomials o…
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…
We study the relationship between operators, orthonormal basis of subspaces and frames of subspaces (also called fusion frames) for a separable Hilbert space $\mathcal{H}$. We get sufficient conditions on an orthonormal basis of subspaces…
Finite frame theory has a number of real-world applications. In applications like sparse signal processing, data transmission with robustness to erasures, and reconstruction without phase, there is a pressing need for deterministic…
We introduce the notion of equiangular tight frames in real symplectic spaces and formulate a conjecture on their existence in terms of the dimension and number of vectors. Our main results shows the "symplectic Zauner's conjecture" is…
Almost exponentially localized polynomial kernels are constructed on the unit ball $B^d$ in $\RR^d$ with weights %functions $W_\mu(x)= (1-|x|^2)^{\mu-1/2}$, $\mu \ge 0$, by smoothing out the coefficients of the corresponding orthogonal…
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…
Multivariate Krawtchouk polynomials are constructed explicitly as Birth and Death polynomials, which have the nearest neighbour interactions. They form the complete set of eigenpolynomials of a birth and death process with the birth and…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
In this paper we give a combinatorial characterization of tight fusion frame (TFF) sequences using Littlewood-Richardson skew tableaux. The equal rank case has been solved recently by Casazza, Fickus, Mixon, Wang, and Zhou. Our…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
This paper introduces a new construction of subcomplexes associated with a truncated multicomplex. Inspired by the machinery of spectral sequences, this construction yields a collection of interrelated subcomplexes whose differentials…
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving…
In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…
A geometric perspective involving Grammian and frame operators is used to derive the entire family of Welch bounds. This perspective unifies a number of observations that have been made regarding tightness of the bounds and their…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
We present a theory of finite frames for subspaces of $\mathbb{C}^N$ . The definition of a subspace frame is given and results analogous to those from frame theory for $\mathbb{C}^N$ are proven.
Two decades ago, Zauner conjectured that for every dimension $d$, there exists an equiangular tight frame consisting of $d^2$ vectors in $\mathbb{C}^d$. Most progress to date explicitly constructs the promised frame in various dimensions,…
The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+eps)-approximations in f(k,eps)n^{O(1)} time where k is some parameter of the input. We obtain the following results on…
First we show that tight nonorthogonal fusion frames a relatively easy to com by. In order to do this we need to establish a classification of how to to wire a self adjoint operator as a product of (nonorthogonal) projection operators. We…