Related papers: The Strong Singular Value Property for Matrices
We study the analytic properties of a matrix discrete system introduced in [7]. The singularity confinement for this system is shown to hold generically, i.e. in the whole space of parameters except possibly for algebraic subvarieties. This…
In the recent paper \cite{1}, Denton et al. provided the eigenvector-eigenvalue identity for Hermitian matrices, and a survey was also given for such identity in the literature. The main aim of this paper is to present the identity related…
We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…
Let $p_1<p_2<\cdots<p_n$ be positive real numbers. It is shown that the matrix whose $i,j$ entry is $(p_i+p_j)^{p_i+p_j}$ is infinitely divisible, nonsingular and totally positive.
In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…
We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…
We use classical results from harmonic analysis on matrix spaces to investigate the relation between the joint density of the singular values and of the eigenvalues of complex random matrices which are bi-unitarily invariant (also known as…
Strong matrix properties, roughly speaking, refer to generic conditions on a matrix such that its spectral perturbation and pattern perturbation interact nicely to cover a neighborhood in the ambient space. With a rich history, these strong…
We introduce a criterion called the Devron property that a discrete dynamical system can possess. The Devron property is said to occur when a class of highly singular inputs of a mapping F are carried by some iterate of $F^{-1}$ to a class…
We perturb a real matrix $A$ of full column rank, and derive lower bounds for the smallest singular values of the perturbed matrix, in terms of normwise absolute perturbations. Our bounds, which extend existing lower-order expressions,…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…
We prove the nonsingularity of a class of integer matrices V(n,d), namely power-product matrix, for positive integers n and d. Some technical proofs are mainly based on linear algebra and enumerative combinatorics, particularly the…
We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i.e. zero-nonzero pattern). Our new variant provides an…
For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…
The singularity confinement test is very useful for isolating integrable cases of discrete-time dynamical systems, but it does not provide a sufficient criterion for integrability. Quite recently a new property of the bilinear equations…
We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…