Related papers: Column bounded matrices and Grothendieck's inequal…

We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We present an elementary, self-contained proof of Grothendieck's inequality that unifies the real and complex cases and yields both the Krivine and Haagerup bounds, the current best-known explicit bounds for the real and complex…

Let A be an n by m matrix with real entries. Consider the set Bad_A of x \in [0,1)^n for which there exists a constant c(x)>0 such that for any q \in Z^m the distance between x and the point {Aq} is at least c(x) |q|^{-m/n}. It is shown…

The following hypothesis was formulated by Goreinov, Tyrtyshnikov, and Zamarashkin in \cite{goreinov1997theory}. If $U$ is $n\times k$ real matrix with the orthonormal columns $(n>k)$, then there exists a submatrix $Q$ of $U$ of size…

We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…

There exists a generalization of the concept, completely bounded norm for multilinear maps on C*-algebras. We will use the word, Jordan norm, for this norm. The Jordan norm of a multilinear map is obtained via factorizations of the map,…

Inspired by Morse theory, we introduce a topological stack Broken, which we refer to as the moduli stack of broken lines. We show that Broken can be presented as a Lie groupoid with corners and provide a combinatorial description of sheaves…

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…

Some subadditivity results involving symmetric (unitarily invariant) norms are obtained. For instance, if $g(t)=\sum_{k=0}^m a_kt^k$ is a polynomial of degree $m$ with non-negative coefficients, then, for all positive operators $A,\,B$ and…

Given a fixed matrix, the problem of column subset selection requests a column submatrix that has favorable spectral properties. Most research from the algorithms and numerical linear algebra communities focuses on a variant called…

We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…

In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…

A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was…

The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \times n$ matrix with all entries $0$ or $1$ containing no $s \times t$ submatrix consisting entirely of $1$'s. We show that a classical…

We show that two important quantities from two disparate areas of complexity theory --- Strassen's exponent of matrix multiplication $\omega$ and Grothendieck's constant $K_G$ --- are intimately related. They are different measures of size…

Let $v_1$,..., $v_n$ be $n$ vectors in an inner product space. Can we find a natural number $d$ and positive (semidefinite) complex matrices $A_1$,..., $A_n$ of size $d \times d$ such that ${\rm Tr}(A_kA_l)= <v_k, v_l>$ for all $k,l=1,...,…

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

For an $m \times n$ complex matrix $X$ of rank $r$ with Schur multiplier $S_X$ we show that there exist an $ r \times m $ complex matrix $L$ and an $ r\times n $ complex matrix $R$ such that $X = L^*R$ and $\|S_X\|\, =\, \|\mathrm{diag}…

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…