Related papers: The Structure of Extremal Bad Science Matrices
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…
Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of…
We introduce a new class of mean regression estimators -- penalized maximum tangent likelihood estimation -- for high-dimensional regression estimation and variable selection. We first explain the motivations for the key ingredient, maximum…
We use the linear programming algorithm introduced by Akulin et al. [V. M. Akulin, G. A. Kabatiansky, and A. Mandilara, Phys. Rev. A 92, 042322 (2015)] to perform best separable approximation on two-qutrit random density matrices. We…
Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…
We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…
The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…
\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\{\mathcal{X}_{n}(i)$ $:$ $1$ $\leq $ $i$ $\leq $ $\mathcal{L}\}_{n\geq 1}$, where each $\mathcal{X}_{n}(i)$ is assumed to converge in…
Chatterjee, Diaconis and Sly (2011) recently established the consistency of the maximum likelihood estimate in the $\beta$-model when the number of vertices goes to infinity. By approximating the inverse of the Fisher information matrix, we…
Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…
We consider Jacobi matrices $J$ whose parameters have the power asymptotics $\rho_n=n^{\beta_1} \left( x_0 + \frac{x_1}{n} + {\rm O}(n^{-1-\epsilon})\right)$ and $q_n=n^{\beta_2} \left( y_0 + \frac{y_1}{n} + {\rm O}(n^{-1-\epsilon})\right)$…
Given a real number $\alpha \in (0,1)$, we define the Webster sequence of density $\alpha$ to be $W_\alpha = (\lceil(n-1/2) / \alpha\rceil)_{n\in\mathbb{N}}$, where $\lceil x \rceil$ is the ceiling function. It is known that if $\alpha$ and…
In the theory of linear switching systems with discrete time, as in other areas of mathematics, the problem of studying the growth rate of the norms of all possible matrix products $A_{\sigma_{n}}\cdots A_{\sigma_{0}}$ with factors from a…
We observe a sample of $n$ independent $p$-dimensional Gaussian vectors with Toeplitz covariance matrix $ \Sigma = [\sigma_{|i-j|}]_{1 \leq i,j \leq p}$ and $\sigma_0=1$. We consider the problem of testing the hypothesis that $\Sigma$ is…
Suppose one has a collection of parameters indexed by a (possibly infinite dimensional) set. Given data generated from some distribution, the objective is to estimate the maximal parameter in this collection evaluated at this distribution.…
We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$ (for…
We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…
The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…
The supporting vectors of a matrix A are the solutions of max || x ||_2 =1 {||Ax||_2^2}. The generalized supporting vectors of matrices A_1 , . . . , A_k are the solutions of max || x ||_2 =1 {||A_1x||_2^2 + ||A_2x||_2^2 + ... +…