Related papers: Approximately Hadamard matrices and Riesz bases in…
This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…
We consider countable families of vectors in a separable Hilbert space, which are mutually localized with respect to a fixed localized Riesz basis. We prove the equivalence of the frame property and nine conditions that do not involve any…
We consider \textit{additive spaces}, consisting of two intervals of unit length or two general probability measures on ${\mathbb R}^1$, positioned on the axes in ${\mathbb R}^2$, with a natural additive measure $\rho$. We study the…
The paper is devoted to the derivation of random unitary matrices whose spectral statistics is the same as statistics of quantum eigenvalues of certain deterministic two-dimensional barrier billiards. These random matrices are extracted…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
If $\{x_n\}_{n \in \mathbb{N}}$ is a frame for a Hilbert space $H,$ then there exists a canonical dual frame $\{\tilde{x_n}\}_{n \in \mathbb{N}}$ such that for every $x \in H$ we have $x = \sum \langle x, \tilde{x_n} \rangle \, x_n,$ with…
A complex Hadamard matrix is a square matrix W with complex entries of absolute value 1 satisfying WW*=nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we give constructions of complex…
Given an orthonormal basis $ {\mathcal V}= \{v_j\} _{j\in N}$ in a separable Hilbert space $H$ and a set of unit vectors $ {\mathcal B}=\{w_j\}_{j\in N}$, we consider the sets $ {\mathcal B}_N$ obtained by replacing the vectors $v_1, ...,\,…
Random orthogonal matrices play an important role in probability and statistics, arising in multivariate analysis, directional statistics, and models of physical systems, among other areas. Calculations involving random orthogonal matrices…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Given a Hilbert space and the generator of a strongly continuous group on this Hilbert space. If the eigenvalues of the generator have a uniform gap, and if the span of the corresponding eigenvectors is dense, then these eigenvectors form a…
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…
Random matrix theory has become a widely useful tool in high-dimensional statistics and theoretical machine learning. However, random matrix theory is largely focused on the proportional asymptotics in which the number of columns grows…
Randomized block Kaczmraz method plays an important role in solving large-scale linear system. One of the key points of this type of methods is how to effectively select working rows. However, in most of the state-of-the-art randomized…
For an $N \times N$ matrix $A$, its rank-$r$ rigidity, denoted $\mathcal{R}_A(r)$, is the minimum number of entries of $A$ that one must change to make its rank become at most $r$. Determining the rigidity of interesting explicit families…
We study an intriguing question in frame theory we call "Weaving Frames" that is partially motivated by preprocessing of Gabor frames. Two frames $\{\varphi_i\}_{i\in I}$ and $\{\psi_i \}_{i\in I}$ for a Hilbert space ${\mathbb H}$ are…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
The Kaczmarz algorithm is a simple iterative scheme for solving consistent linear systems. At each step, the method projects the current iterate onto the solution space of a single constraint. Hence, it requires very low cost per iteration…
We investigate random matrices whose entries are obtained by applying a nonlinear kernel function to pairwise inner products between $n$ independent data vectors, drawn uniformly from the unit sphere in $\mathbb{R}^d$. This study is…