English
Related papers

Related papers: Multiplicatively badly approximable matrices up to…

200 papers

Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…

Data Structures and Algorithms · Computer Science 2020-08-04 Lily Li , Aleksandar Nikolov

For a matrix $T \in M_m(\mathbb{C})$, let $|T| : = \sqrt{T^*T}$. For $A \in M_m(\mathbb{C})$, we show that the matrix sequence $\big\{ |A^n|^{\frac{1}{n}} \big\}_{n \in \mathbb{N}}$ converges in norm to a positive-semidefinite matrix $H$…

Functional Analysis · Mathematics 2023-11-13 Soumyashant Nayak

Let $\mathbf{A}\in \mathbb{R}^{n\times n}$ be a matrix with diagonal $\text{diag}(\mathbf{A})$ and let $\bar{\mathbf{A}}$ be $\mathbf{A}$ with its diagonal set to all zeros. We show that Hutchinson's estimator run for $m$ iterations returns…

Data Structures and Algorithms · Computer Science 2022-11-08 Prathamesh Dharangutte , Christopher Musco

Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…

Number Theory · Mathematics 2025-03-21 Akshat Mudgal

In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…

Combinatorics · Mathematics 2025-11-19 Boris Alexeev , John Jasper , Dustin G. Mixon

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

Number Theory · Mathematics 2025-09-01 Moubariz Z. Garaev , Julio C. Pardo

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

Number Theory · Mathematics 2025-05-01 Bo Tan , Qing-Long Zhou

Kadeishvili's minimal model theorem establishes the existence of an $A_\infty$-structure, unique up to isomorphism, on the cohomology of a dg associative algebra, which captures its homotopy type. In this note we prove the existence of…

Algebraic Topology · Mathematics 2024-05-15 Martin Markl

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

Algebraic Geometry · Mathematics 2012-01-12 Jairo Bochi , Nicolas Gourmelon

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

Number Theory · Mathematics 2020-04-20 Lucile Devin

In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \times r$ and $r…

Data Structures and Algorithms · Computer Science 2011-11-04 Sanjeev Arora , Rong Ge , Ravi Kannan , Ankur Moitra

We prove logarithmic Sobolev inequality for measures $$ q^n(x^n)=\text{dist}(X^n)=\exp\bigl(-V(x^n)\bigr), \quad x^n\in \Bbb R^n, $$ under the assumptions that: (i) the conditional distributions $$ Q_i(\cdot| x_j, j\neq i)=\text{dist}(X_i|…

Probability · Mathematics 2015-06-23 Katalin Marton

Many real-world data sets are sparse or almost sparse. One method to measure this for a matrix $A\in \mathbb{R}^{n\times n}$ is the \emph{numerical sparsity}, denoted $\mathsf{ns}(A)$, defined as the minimum $k\geq 1$ such that…

Data Structures and Algorithms · Computer Science 2021-07-06 Vladimir Braverman , Robert Krauthgamer , Aditya Krishnan , Shay Sapir

Let ${\bf M}=(M_1,\ldots, M_k)$ be a tuple of real $d\times d$ matrices. Under certain irreducibility assumptions, we give checkable criteria for deciding whether ${\bf M}$ possesses the following property: there exist two constants…

Dynamical Systems · Mathematics 2017-02-24 De-Jun Feng , Chiu-Hong Lo , Shuang Shen

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

Number Theory · Mathematics 2025-07-17 Bin Chen

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

Data Structures and Algorithms · Computer Science 2016-08-23 Sushant Sachdeva , Nisheeth K. Vishnoi

We prove, in particular, the well--known Zaremba conjecture from the theory of continued fractions for any prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists…

Number Theory · Mathematics 2026-03-17 Ilya D. Shkredov

We establish the existence of solutions to common noise McKean-Vlasov martingale problems for coefficients with low regularity. Our approach is able to handle the key challenge posed by drift coefficients that are discontinuous with respect…

Probability · Mathematics 2025-09-01 Robert Alexander Crowell

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare
‹ Prev 1 3 4 5 6 7 10 Next ›