Related papers: Some counting questions for matrix products

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…

First, we prove that the set of $n\times n$ complex matrices is the closure of a certain open subset whose elements have a very specific canonical form under congruence, which is uniquely determined up to the values of some parameters, but…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

Given a graded sequence of ideals (a_m) on a smooth variety $X$ having finite log canonical threshold, suppose that for every m we have a divisor E_m over X that computes the log canonical threshold of a_m, and such that the log…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include…

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$ matrix $H$. A longstanding open…

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

The diversity product and the diversity sum are two very important parameters for a good-performing unitary space time constellation. A basic question is what the maximal diversity product (or sum) is. In this paper we are going to derive…

We study $m \times n$ matrices whose columns are of the form \[\{(a_{1j},\ldots, a_{nj}): \quad a_{1j} = \lambda_j,\ a_{ij} = \pm\lambda_j\ , \ \lambda_j >0 ,\ j=1,2,\ldots,n\}.\] We explicitly construct for all $a = (a_1,\ldots,…

We consider the following matrix reachability problem: given $r$ square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability…

Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite…

We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…

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 provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…

Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…

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…

This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…