Related papers: Johnson-Lindenstrauss lemma for circulant matrices
Allen-Zhu, Gelashvili, Micali, and Shavit construct a sparse, sign-consistent Johnson-Lindenstrauss distribution, and prove that this distribution yields an essentially optimal dimension for the correct choice of sparsity. However, their…
Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…
We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…
The O(n) vector model with logarithmic action on a lattice of coordination 3 is related to a gas of self-avoiding loops on the lattice. This formulation allows for analytical continuation in n: critical behaviour is found in the real…
We prove that for any $n\times n$ matrix, $A$, and $z$ with $|z|\geq \|A\|$, we have that $\|(z-A)^{-1}\|\leq\cot (\frac{\pi}{4n}) \dist (z, \spec(A))^{-1}$. We apply this result to the study of random orthogonal polynomials on the unit…
The Lopsided Lov\'{a}sz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While originally a general statement about probability spaces, it has recently been…
For a Jacobi matrix J on l^2(Z_+) with Ju(n)=a_{n-1} u(n-1) + b_n u(n) + a_n u(n+1), we prove that \sum_{|E|>2} (E^2 -4)^{1/2} \leq \sum_n |b_n| + 4\sum_n |a_n -1|. We also prove bounds on higher moments and some related results in higher…
The type IIB matrix model has been investigated as a possible nonperturbative formulation of superstring theory. In particular, it was found by Monte Carlo simulation of the Lorentzian version that the 9-dimensional rotational symmetry of…
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…
We report the simplest possible form to compute rotations around arbitrary axis and boosts in arbitrary directions for 4-vectors (space-time points, energy-momentum) and bi-vectors (electric and magnetic field vectors) by symplectic…
We study motivic Donaldson-Thomas invariants in the sense of Behrend-Bryan-Szendroi. A wall-crossing formula under a mutation is proved for a certain class of quivers with potentials.
We prove a polynomial upper bound for the localization length of the Lorentz mirror model and the Manhattan model on the even cylinder. The main input is a conditional cylinder-localization theorem in the winding regime: if short-direction…
Template matching is widely used for many applications in image and signal processing and usually is time-critical. Traditional methods usually focus on how to reduce the search locations by coarse-to-fine strategy or full search combined…
We continue the study of boundary operators in the dense O(n) model on the random lattice. The conformal dimension of boundary operators inserted between two JS boundaries of different weight is derived from the matrix model description.…
In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric…
In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic…
For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…
We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n) algorithm. We do not have any recursion overhead or stack…
A new method to numerically calculate the $n$th moment of the spin overlap of the two-dimensional $\pm J$ Ising model is developed using the identity derived by one of the authors (HK) several years ago. By using the method, the $n$th…