Related papers: Results about persymmetric matrices over F_2 and r…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

We show that if A_1, A_2, ... , A_n are square matrices, each of them is either unitary or self-adjoint, and they almost commute with respect to the rank metric, then one can find commuting matrices B_1, B_2, ... , B_n that are close to the…

We define and solve classes of sparse matrix problems that arise in multilevel modeling and data analysis. The classes are indexed by the number of nested units, with two-level problems corresponding to the common situation in which data on…

We suggest an hierarchy of all the results known so far about the connection of the asymptotics of combinatorial or representation theoretic problems with ``beta=2 ensembles'' arising in the random matrix theory. We show that all such…

The main purpose of this paper is to propose some interesting number theory problems related to the Legendre's symbol and the two-term exponential sums.

This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion…

The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix $B \in \mathbb{F}^{n \times n}$ is defined as $\ell_1 \ell_2 \cdots \ell_n$, where $\ell_j \in \{\tt{A}, \tt{S}, \tt{N}\}$ according to whether all,…

We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.

We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries.

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

We prove deviation inequalities for sums of high-dimensional random matrices and operators with dependence and {\rc heavy tails}. Estimation of high-dimensional matrices is a concern for numerous modern applications. However, most results…

We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…