Related papers: Approximately Hadamard matrices and Riesz bases in…

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

Scale invariance of an algorithm refers to its ability to treat objects equally independently of their size. For neural networks, scale invariance is typically achieved by data augmentation. However, when presented with a scale far outside…

Assume that $H$ is a circulant Hadamard matrix of order $n\geq 4$. We consider an appropriate stochastic matrix $S$ of order $n$ depending on $H$. This allows us to prove that $n = 4$. Thus, there are only $10$ circulant Hadamard matrices.

Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…

The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash functions. As a result, numerous matrix structures, including Hadamard and circulant matrices, have…

This paper investigates the properties of continuous frames, with a particular focus on phase retrieval and norm retrieval in the context of Hilbert spaces. We introduce the concept of continuous near-Riesz bases and prove their invariance…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

We prove that independent rectangular random matrices, when embedded in a space of larger square matrices, are asymptotically free with amalgamation over a commutative finite dimensional subalgebra $D$ (under an hypothesis of unitary…

We consider level crossing in a matrix family $H=H_0+\lambda V$ where $H_0$ is a fixed $N\times N$ matrix and $V$ belongs to one of the standard Gaussian random matrix ensembles. We study the probability distribution of level crossing…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

A sparse random block matrix model suggested by the Hessian matrix used in the study of elastic vibrational modes of amorphous solids is presented and analyzed. By evaluating some moments, benchmarked against numerics, differences in the…

We study strongly measurable random bounded operators on separable Hilbert spaces and analyze two simple iterations driven by independent random positive contractions. The first, a Kaczmarz-like iteration, converges in mean square and…

The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a…

The Feichtinger Conjecture, if true, would have as a corollary that for each set $E\subset \T$ and $\Lambda \subset \Z$, there is a partition $\Lambda_1,...,\Lambda_N$ of $\Z$ such that for each $1\le i \le N$, $\{\exp(2\pi i x\lambda):…

Let $A \in \mathbb{R}^{n \times n}$ be invertible, $x \in \mathbb{R}^n$ unknown and $b =Ax $ given. We are interested in approximate solutions: vectors $y \in \mathbb{R}^n$ such that $\|Ay - b\|$ is small. We prove that for all $0<…

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

In this article, we consider a variation of the existence of Gabor frames in a probabilistic setting, in which we consider time-frequency shifts taken over random-periodic sets. We demonstrate that the method of selecting random-periodic…

We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions of $n$, the 1st, 2nd, and so on, rows behave, suitably scaled, like the 1st, 2nd, and so on, eigenvalues…

We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…

Using a family of graded algebra structures on a planar algebra and a family of traces coming from random matrix theory, we obtain a tower of non-commutative probability spaces, naturally associated to a given planar algebra. The associated…