相关论文: Multiplicatively badly approximable matrices up to…

It is well-known that a quiver Q of type A_n is representation-finite, and that its indecomposable representations are thin (all Jordan-Hoelder multiplicities are 0 or 1). By now, various methods of proof are known. The aim of this note is…

We discuss optimal constants in a recent result of Rudelson and Vershynin on marginal densities. We show that if $f$ is a probability density on $\R^n$ of the form $f(x)=\prod_{i=1}^n f_i(x_i)$, where each $f_i$ is a density on $\R$, say…

We study coded distributed matrix multiplication from an approximate recovery viewpoint. We consider a system of $P$ computation nodes where each node stores $1/m$ of each multiplicand via linear encoding. Our main result shows that the…

In this paper, we study the weighted $n$-dimensional badly approximable points on manifolds. Given a $C^n$ differentiable non-degenerate submanifold $\mathcal{U} \subset \mathbb{R}^n$, we will show that any countable intersection of the…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

Bernstein-von Mises results (BvM) establish that the Laplace approximation is asymptotically correct in the large-data limit. However, these results are inappropriate for computational purposes since they only hold over most, and not all,…

Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…

We consider the problem of preprocessing an $n\times n$ matrix $\mathbf{M}$, and supporting queries that, for any vector $v$, returns the matrix-vector product $\mathbf{M} v$. This problem has been extensively studied in both theory and…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Estimates of the approximate factor model are increasingly used in empirical work. Their theoretical properties, studied some twenty years ago, also laid the ground work for analysis on large dimensional panel data models with cross-section…

Suppose $\left \{ X_{i,k}; 1\le i \le p, 1\le k \le n \right \} $ is an array of i.i.d.~real random variables. Let $\left \{ p=p_{n}; n \ge1 \right \} $ be positive integers. Consider the maximum interpoint distance $M_{n}=\max_{1\le i<…

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

This article is concerned with Monte-Carlo methods for the estimation of the trace of an implicitly given matrix $A$ whose information is only available through matrix-vector products. Such a method approximates the trace by an average of…

We prove that the Hausdorff dimension of the set of badly approximable systems of m linear forms in n variables over the field of Laurent series with coefficients from a finite field is maximal. This is a analogue of Schmidt's…

We establish the fundamental limits of lossless linear analog compression by considering the recovery of random vectors ${\boldsymbol{\mathsf{x}}}\in{\mathbb R}^m$ from the noiseless linear measurements…