We consider n × n real symmetric and hermitian random matrices Hₙ that are sums of a non-random matrix $H{ₙ}^{\left(0\right)}$ and of mₙ rank-one matrices determined by i.i.d. isotropic random vectors with log-concave probability law and real amplitudes. This is an analog of the setting of Marchenko and Pastur [Mat. Sb. 72 (1967)]. We prove that if mₙ/n → c ∈ [0,∞) as n → ∞, and the distribution of eigenvalues of $H{ₙ}^{\left(0\right)}$ and the distribution of amplitudes converge weakly, then the distribution of eigenvalues of Hₙ converges...

A matrix generalization of Kronecker's lemma is presented with assumptions that make it possible not only the unboundedness of the condition number considered by Anderson and Moore (1976) but also other sequences of real matrices, not necessarily monotone increasing, symmetric and nonnegative definite. A useful matrix decomposition and a well-known equivalent result about convergent series are used in this generalization.

Let N be a set of natural numbers and Z be a set of integers. Let M₂(Z) denotes the set of all 2x2 matrices with integer entries. We give necessary and suficient conditions for solvability of the matrix negative Pell equation (P) X² - dY² = -I with d ∈ N for nonsingular X,Y belonging to M₂(Z) and his generalization (Pn) ${\sum }_{i=1}^{n}X{₂}_i-d{\sum }_{i=1}^{n}Y{²}_i=-I$ with d ∈ N for nonsingular $X_i,Y_i\in M₂\left(Z\right)$, i=1,...,n.

Let $n$ be a positive integer, and $C_n\left(r\right)$ the set of all $n\times n$$r$-circulant matrices over the Boolean algebra $B=\{0,1\}$, $G_n={\bigcup }_{r=0}^{n-1}{C}_n\left(r\right)$. For any fixed $r$-circulant matrix $C$ ($C\ne 0$) in $G_n$, we define an operation “$*$” in $G_n$ as follows: $A*B=ACB$ for any $A,B$ in $G_n$, where $ACB$ is the usual product of Boolean matrices. Then $(G_n,*)$ is a semigroup. We denote this semigroup by $G_n\left(C\right)$ and call it the sandwich semigroup of generalized circulant...

For p ≤ n, let b1(n),...,bp(n) be independent random vectors in ${ℝ}^n$ with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the Euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lovász (LLL). If ${\widehat{b}}_1^{\left(n\right)},...,{\widehat{b}}_p^{\left(n\right)}$ is the basis obtained from b1(n),...,bp(n) by Gram-Schmidt orthogonalization, the quality of the reduction depends upon the sequence of ratios...

The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing number equals...