Related papers: Abundance of Matrices In Gaussian Integers
In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…
Abundancy index refers to the ratio of the sum of the divisors of a number to the number itself. It is a concept of great importance in defining friendly and perfect numbers. Here, we describe a suitable generalization of abundancy index to…
Let $\alpha $ be a $p \times q$ interval matrix with $p \geq q$ and with the endpoints of all its entries in the set of the rational numbers. We prove that, if $\alpha $ contains a rank-$r$ real matrix with $r \in \{2, q-2,q-1,q\}$, then it…
We consider a random matrix whose entries are independent Gaussian variables taking values in the field of quaternions with variance $1/n$. Using logarithmic potential theory, we prove the almost sure convergence, as the dimension $n$ goes…
A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…
An interval matrix is a matrix whose entries are intervals in the set of real numbers. We generalize this concept, which has been broadly studied, to other fields. Precisely we define a rational interval matrix to be a matrix whose entries…
It has been established on many occasions that the set of quotients of prime numbers is dense in the set of positive real numbers. More recently, it has been proved that the set of quotients of primes in the Gaussian integers is dense in…
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and…
Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…
An interval matrix is a matrix whose entries are intervals in the set of real numbers. Let $p , q $ be nonzero natural numbers and let $\mu =( [m_{i,j}, M_{i,j}])_{i,j}$ be a $p \times q$ interval matrix; given a $p \times q$ matrix $A$…
Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…
A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…
The probability that a tuple of matrices together with all scalars generates a finite incidence ring is calculated. It is proved that all real and complex finite-dimensional incidence algebras are generated by two randomly chosen matrices.
For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
1. A standard Gaussian random matrix has full rank with probability 1 and is well-conditioned with a probability quite close to 1 and converging to 1 fast as the matrix deviates from square shape and becomes more rectangular. 2. If we…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
The theory of Gromov-Hausdorff convergence is applied to sequences of quotient rings of integers. It is shown the existence of limit rings (fields) as the Gromov-Hausdorff limits of sequences of metric quotient rings. The relation of these…