Related papers: Power-product matrix: nonsingularity, sparsity and…

If a left-product $M_n... M_1$ of square complex matrices converges to a nonnull limit when $n\to\infty$ and if the $M_n$ belong to a finite set, it is clear that there exists an integer $n_0$ such that the $M_n$, $n\ge n_0$, have a common…

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by…

We prove that every nonderogatory matrix $A$ over a field of positive odd characteristic $p,$ that is sum of a $p$-potent matrix and a nilpotent matrix, has a decomposition $A=E+V,$ such that $E^p=E,$ and $V^3=0.$

Let $\mathbf{A}$ be an $n\times n$-matrix over $\mathbb{F}_2$ whose every entry equals $1$ with probability $d/n$ independently for a fixed $d>0$. Draw a vector $\mathbf{y}$ randomly from the column space of $\mathbf{A}$. It is a simple…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We explicitly calculate the triangle inequalities for the group PSO(8). Therefore we explicitly solve the eigenvalues of sum problem for this group (equivalently describing the side-lengths of geodesic triangles in the corresponding…

N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…

We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

Let K denote a field. Given an arbitrary linear subspace V of M_n(K) of codimension lesser than n-1, a classical result states that V generates the K-algebra M_n(K). Here, we strengthen this in three ways: we show that M_n(K) is spanned by…

It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord…

Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…

We prove that the determinant of a Gaussian-correlation matrix V of n evenly spaced points has leading power n(n-1) in the nearest-neighbor distance between points. The proof uses Neville elimination to determine all elements of the upper…

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…