Related papers: A Short Proof for Gap Independence of Simultaneous…

We introduce an algorithm for detection of bugs in sequential circuits. This algorithm is incomplete i.e. its failure to find a bug breaking a property P does not imply that P holds. The appeal of incomplete algorithms is that they scale…

This paper considers the empirical spectral measure of a power of a random matrix drawn uniformly from one of the compact classical matrix groups. We give sharp bounds on the $L_p$-Wasserstein distances between this empirical measure and…

We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for…

A fundamental question in parallel computation, posed by Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988), asks: \emph{given only independence-oracle access to a matroid on $n$ elements, how many rounds are required to find a basis using…

In this article, we consider two proper double splittings satisfying certain conditions, of a semi-monotone rectangular matrix A and derive new comparison results for the spectral radii of the correspond ing iteration matrices. These…

We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…

The aim of this paper is to study the spectral gap and the logarithmic Sobolev constant for continuous spin systems. A simple but general result for estimating the spectral gap of finite dimensional systems is given by Theorem 1.1, in terms…

We study simultaneous inference for multiple matrix-variate Gaussian graphical models in high-dimensional settings. Such models arise when spatiotemporal data are collected across multiple sample groups or experimental sessions, where each…

The spectral gap occupies a role of central importance in many open problems in physics. We present an approach for evaluating the spectral gap of a Hamiltonian from a simple ratio of two expectation values, both of which are evaluated…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Eigenspaces of covariance matrices play an important role in statistical machine learning, arising in variety of modern algorithms. Quantitatively, it is convenient to describe the eigenspaces in terms of spectral projectors. This work…

We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.

Inspired by the work done by Belavkin [Belavkin V. P., Stochastics, 1, 315 (1975)], and independently by Mochon, [Phys. Rev. A 73, 032328, (2006)], we formulate the problem of minimum error discrimination of any ensemble of $n$ linearly…

An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…

This paper introduces a boundary integral equation for time-harmonic electromagnetic scattering by composite dielectric objects. The formulation extends the classical M\"uller equation to composite structures through the global multi-trace…

Let $f$ be a transcendental entire function. By a result of Rippon and Stallard, there exist points whose orbit escapes arbitrarily slowly. By using a range of techniques to prove new covering results, we extend their theorem to prove the…

Base on a conjecture, we prove that for any smooth separated stack of finite type over a number field, its descent obstruction equals its iterated descent obstruction. As a consequence, we show that for any algebraic stack over a number…

We present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of…

We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…

This article provides an account of the functorial correspondence between irreducible singular $G$-monopoles on $S^1\times \Sigma$ and $\vec{t}$-stable meromorphic pairs on $\Sigma$. The main theorem of [1] is thus generalized here from…