Related papers: Johnson-Lindenstrauss lemma for circulant matrices

We use Coulomb gas methods to propose an explicit form for the scaling limit of the partition function of the critical O(n) model on an annulus, with free boundary conditions, as a function of its modulus. This correctly takes into account…

We continue to study the notion of cancellation-free linear circuits. We show that every matrix can be computed by a cancellation- free circuit, and almost all of these are at most a constant factor larger than the optimum linear circuit…

Many latent-variable applications, including community detection, collaborative filtering, genomic analysis, and NLP, model data as generated by low-rank matrices. Yet despite considerable research, except for very special cases, the number…

In this paper, firstly, we give the some fundamental properties of Van Der Laan numbers. After, we define the circulant matrices C(Z) which entries is third order linear recurrent sequence. In addition, we compute eigenvalues, spectral norm…

We develop a framework based on energy kicks for the evolution of high-eccentricity long-period orbits with Jacobi constant close to 3 in the restricted circular planar three-body problem where the secondary and primary masses have mass…

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral…

This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…

Linial's seminal result shows that any deterministic distributed algorithm that finds a $3$-colouring of an $n$-cycle requires at least $\log^*(n)/2 - 1$ communication rounds. We give a new simpler proof of this theorem.

We consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this…

The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…

Answering a question of Farb-Leininger-Margalit, we give explicit lower bounds for the dilatations of pseudo-Anosov mapping classes lying in the kth term of the Johnson filtration of the mapping class group.

We consider bound geodesic orbits of test masses in the exterior gravitational field of a rotating astronomical source whose proper angular momentum varies linearly with time. The linear perturbation approach of Lense and Thirring is herein…

We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\mathcal{O}(\log n)$ applications of the matrix on…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…

The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and…

The explicit semiclassical treatment of logarithmic perturbation theory for the bound-state problem within the framework of the radial Klein-Gordon equation with attractive real-analytic screened Coulomb potentials, contained time-component…

In this paper, we first give new generalizations for third-order Jacobsthal $\{J_{n}^{(3)}\}_{n\in \mathbb{N}}$ and third-order Jacobsthal-Lucas $\{j_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for Jacobsthal and Jacobsthal-Lucas numbers.…