Related papers: Tight and random nonorthogonal fusion frames

In this paper we generalize a strategy recently proposed by the author concerning intertwining operators. In particular we discuss the possibility of extending our previous results in such a way to construct (almost) isospectral…

Fusion is defined for arbitrary lowest weight representations of $W$-algebras, without assuming rationality. Explicit algorithms are given. A category of quasirational representations is defined and shown to be stable under fusion.…

In this Letter we suggest a method of convex rigid frames in the studies of the multipartite quNit pure-states. We illustrate what are the convex rigid frames and what is the method of convex rigid frames. As the applications we use this…

Using a relation between a bi-orthogonal set of equiseparable bases and the weak values of the density matrix we derive an explicit formula for its tomographic reconstruction completely analogous to the standard mutually unbiased bases…

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…

The anomaly of non-invertible higher-form symmetries is determined by the braiding of topological operators implementing them. In this paper, we study a method to classify braidings on topological line and surface operators by leveraging…

Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…

Atom interferometers offer excellent sensitivity to gravitational and inertial signals but have limited dynamic range. We introduce a scheme that improves on this trade-off by a factor of 50 using composite fringes, obtained from sets of…

In this paper the notion of the rigid frame of reference within special relativity is analysed. Three definitions of rigidity are formulated. By using several examples of non-inertial frames, it is shown that these definitions are not…

We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A,…

Operator-valued frames (or g-frames) are generalizations of frames and fusion frames and have been used in packets encoding, quantum computing, theory of coherent states and more. In this paper, we give a new formula for operator-valued…

W projection is a commonly-used approach to allow interferometric imaging to be accelerated by Fast Fourier Transforms (FFTs), but it can require a huge amount of storage for convolution kernels. The kernels are not separable, but we show…

We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse…

The human visual perception system has strong robustness in image fusion. This robustness is based on human visual perception system's characteristics of feature selection and non-linear fusion of different features. In order to simulate…

Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and…

We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular…

1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…

Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential…