Related papers: Average-case matrix discrepancy: satisfiability bo…
We introduce the notion of "\delta-complete decision procedures" for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including transcendental functions and solutions of…
We study the problem of testing whether a symmetric $d \times d$ input matrix $A$ is symmetric positive semidefinite (PSD), or is $\epsilon$-far from the PSD cone, meaning that $\lambda_{\min}(A) \leq - \epsilon \|A\|_p$, where $\|A\|_p$ is…
This paper adapts the recently developed rigorous application of the supersymmetric transfer matrix approach for the 1d band matrices to the case of the orthogonal symmetry. We consider $N\times N$ block band matrices consisting of $W\times…
In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim…
In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…
We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…
Let $\mu(t) = \sum_{\tau\in S} \alpha_\tau \delta(t-\tau)$ denote an $|S|$-atomic measure defined on $[0,1]$, satisfying $\min_{\tau\neq \tau'}|\tau - \tau'|\geq |S|\cdot n^{-1}$. Let $\eta(\theta) = \sum_{\tau\in S} a_\tau D_n(\theta -…
We are concerned with solvability of nonlinear systems involving a discrete singular $\phi$-Laplacian operator of type \begin{equation*} u \mapsto \Delta\left[\phi(\Delta u(n-1))\right] \qquad (n\in \{1, \dots, T\}), \end{equation*}…
We undertake a systematic study of sketching a quadratic form: given an $n \times n$ matrix $A$, create a succinct sketch $\textbf{sk}(A)$ which can produce (without further access to $A$) a multiplicative $(1+\epsilon)$-approximation to…
We introduce the large average subtensor problem: given an order-$p$ tensor over $\mathbb{R}^{N\times \cdots \times N}$ with i.i.d. standard normal entries and a $k\in\mathbb{N}$, algorithmically find a $k\times \cdots \times k$ subtensor…
We prove that the logarithm of the determinant of a Wigner matrix satisfies a central limit theorem in the limit of large dimension. Previous results about fluctuations of such determinants required that the first four moments of the matrix…
The model problem of a plane angle for a second-order elliptic system subject to Dirichlet, mixed, and Neumann boundary conditions is analyzed. For each boundary condition, the existence of solutions of the form $r^\lambda v$ is reduced to…
A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…
Assume that $X_{1}, \ldots, X_{N}$ is an $\varepsilon$-contaminated sample of $N$ independent Gaussian vectors in $\mathbb{R}^d$ with mean $\mu$ and covariance $\Sigma$. In the strong $\varepsilon$-contamination model we assume that the…
In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the…
We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…
In this work, we revisit algorithms for Tensor PCA: given an order-$r$ tensor of the form $T = G+\lambda \cdot v^{\otimes r}$ where $G$ is a random symmetric Gaussian tensor with unit variance entries and $v$ is an unknown boolean vector in…
For several different boundary conditions (Dirichlet, Neumann, Robin), we prove norm-resolvent convergence for the operator $-\Delta$ in the perforated domain $\Omega\setminus \bigcup_{ i\in 2\varepsilon\mathbb Z^d }B_{a_\varepsilon}(i),$…