Related papers: A Short Proof for Gap Independence of Simultaneous…
Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
The presence of symmetries is one of the central structural features that make some integer programs challenging for state-of-the-art solvers. In this work, we study the efficacy of Linear Programming (LP) hierarchies in the presence of…
We exhibit an explicit sufficient condition for the Lyapunov exponents of a linear cocycle over a Markov map to have multiplicity 1. This builds on work of Guivarc'h-Raugi and Gol'dsheid-Margulis, who considered products of random matrices,…
The spectral gap theorem of Caputo, Liggett, and Richthammer states that on any connected graph equipped with edge weights, the 2nd eigenvalue of the interchange process equals the 2nd eigenvalue of the random walk process. In this work we…
We give a simple and straightforward proof of the Gap Theorem for separated sequences by A. Poltoratski and M. Mitkovski using the Beurling--Malliavin formula for the radius of completeness.
The Newton-Schulz (NS) iteration has become a key technique for orthogonalization in optimizers such as Muon and for optimization on the Stiefel manifold. Despite its effectiveness, the conventional NS iteration incurs significant…
We propose a new algorithmic framework for sequential hypothesis testing with i.i.d. data, which includes A/B testing, nonparametric two-sample testing, and independence testing as special cases. It is novel in several ways: (a) it takes…
Consider a local chain Differential Graded algebra, such as the singular chain complex of a pathwise connected topological group. In two previous papers, a number of homological results were proved for such an algebra: An Amplitude…
We investigate the number of independent samples in a chaotic reverberation chamber. Its evaluation as defined by the IEC standard can be made more precise when using not the index of the first value larger then the correlation length but…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…
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…
The diffraction of a time-harmonic plane wave on collinear finite defects in a square lattice is studied. This problem is reduced to a matrix Wiener-Hopf equation. This work adapts the recently developed iterative Wiener-Hopf method to this…
The desired shifts of the boundaries of spectral allowed zones of periodical systems are demonstrated. In particular, the phenomenon of merging neighbor allowed zones is exhibited and its simple explanation is given. It is also shown how to…
The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space…
Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…
The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively…
In this paper we describe a parallel Gaussian elimination algorithm for matrices with entries in a finite field. Unlike previous approaches, our algorithm subdivides a very large input matrix into smaller submatrices by subdividing both…
A condition for the presence of a "gap" between symmetric spaces sufficient for the inclusion of one of these spaces into the other to be disjointly strictly singular is found. This condition is stated in terms of fundamental functions of…
For the almost Mathieu operator with a small coupling constant, for a series of spectral gaps, we describe the asymptotic locations of the gaps and get lower bounds for their lengths. The results are obtained by analysing a monodromy…