English
Related papers

Related papers: On the Structure of Bad Science Matrices

200 papers

Let $\delta>1$ and $\beta>0$ be some real numbers. We prove that there are positive $u,v,N_0$ depending only on $\beta$ and $\delta$ with the following property: for any $N,n$ such that $N\ge \max(N_0,\delta n)$, any $N\times n$ random…

Probability · Mathematics 2014-09-30 Konstantin E. Tikhomirov

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

Data Structures and Algorithms · Computer Science 2018-07-13 Masakazu Ishihata , Takanori Maehara , Tomas Rigaux

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

Combinatorics · Mathematics 2023-09-15 Krishnendu Bhowmick , Ben Lund , Oliver Roche-Newton

A square matrix of order $n$ with $n\geq 2$ is called a \textit{permutative matrix} or permutative when all its rows (up to the first one) are permutations of precisely its first row. In this paper, the spectra of a class of permutative…

Spectral Theory · Mathematics 2017-08-08 Cristina B. Manzaneda , Enide Andrade , María Robbiano

The weighted low-rank approximation problem is a fundamental numerical linear algebra problem and has many applications in machine learning. Given a $n \times n$ weight matrix $W$ and a $n \times n$ matrix $A$, the goal is to find two…

Computational Complexity · Computer Science 2025-02-25 Chenyang Li , Yingyu Liang , Zhenmei Shi , Zhao Song

This paper studies the set of $n\times n$ matrices for which all row and column sums equal zero. By representing these matrices in a lower dimensional space, it is shown that this set is closed under addition and multiplication, and…

Rings and Algebras · Mathematics 2008-10-02 Samuel N. Cohen , Robert J. Elliott , Charles E. M. Pearce

Let $A$ be an $n\times n$ matrix with mutually independent centered Gaussian entries. Define \begin{align*} \sigma^*:=\max\limits_{i,j\leq n}\sqrt{{\mathbb E}\,|A_{i,j}|^2}, \quad \sigma:=\max\bigg(\max\limits_{j\leq n}\sqrt{{\mathbb…

Probability · Mathematics 2023-07-26 Konstantin Tikhomirov

Let $\beta \equiv \{ \beta_\mathbf{i} \}_{\mathbf{i} \in \mathbb{Z}_+^d}$ be a $d$-dimensional multisequence. Curto and Fialkow, have shown that if the infinite moment matrix $M(\beta)$ is finite-rank positive semidefinite, then $\beta$ has…

Functional Analysis · Mathematics 2016-10-13 Kaissar Idrissi , El Hassan Zerouali

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…

Statistical Mechanics · Physics 2009-11-11 David S. Dean , Satya N. Majumdar

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee

We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…

Disordered Systems and Neural Networks · Physics 2007-05-23 C. Borgs , J. T. Chayes , S. Mertens , B. Pittel

We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…

Rings and Algebras · Mathematics 2023-07-03 Wouter Kager , Pieter Jacob Storm

Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent…

Machine Learning · Computer Science 2017-12-14 Branislav Kveton , Csaba Szepesvari , Anup Rao , Zheng Wen , Yasin Abbasi-Yadkori , S. Muthukrishnan

We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm has an error bound exponent of only log 4 $\gamma$$\infty$,2 $\approx$ 2.386.…

Data Structures and Algorithms · Computer Science 2026-03-20 Jean-Guillaume Dumas , Clément Pernet , Alexandre Sedoglavic

We present reduction theorems for the problem of optimal unambiguous state discrimination (USD) of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $n$ and are…

Quantum Physics · Physics 2008-06-04 Philippe Raynal , Norbert Lütkenhaus , Steven J. van Enk

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Combinatorics · Mathematics 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

We study the spectral norm of matrices M that can be factored as M=BA, where A is a random matrix with independent mean zero entries, and B is a fixed matrix. Under the (4+epsilon)-th moment assumption on the entries of A, we show that the…

Probability · Mathematics 2016-12-23 Roman Vershynin

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

$p$-adic linear regression is the problem of finding coefficients $\beta$ that minimise $\sum_i |y_i - x_i^\top\beta|_p$. We prove that computing an optimal solution is NP-hard via a polynomial-time reduction from Max Cut using a…

Computational Complexity · Computer Science 2026-02-17 Gregory D. Baker

In the total least squares problem, one is given an $m \times n$ matrix $A$, and an $m \times d$ matrix $B$, and one seeks to "correct" both $A$ and $B$, obtaining matrices $\hat{A}$ and $\hat{B}$, so that there exists an $X$ satisfying the…

Data Structures and Algorithms · Computer Science 2019-09-30 Huaian Diao , Zhao Song , David P. Woodruff , Xin Yang