Related papers: Factorizations of Matrices With Recursive Entries …
In this paper we analyse Cline's matrix equation, generalized Penrose's matrix system and a matrix system for k-commutative {1}-inverses. We determine reproductive and non-reproductive general solutions of analysed matrix equation and…
Motivated by Hirano-Tominaga's work \cite{HT} on rings for which every element is a sum of two idempotents and by de Seguins Pazzis's results \cite{de} on decomposing every matrix over a field of positive characteristic as a sum of…
In the context of applying the Lorentz group theory to polarization optics in the frames of Stokes-Mueller formalism, some properties of the Lorentz group are investigated. We start with the factorized form of arbitrary Lorentz matrix as a…
In this paper, a matrix is said to be prime if the row and column of this matrix are both prime numbers. We establish various necessary and sufficient conditions for developing matrices into the sum of tensor products of prime matrices. For…
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…
The maximal algebras of scalar Toeplitz matrices are known to be formed by generalized circulants. The identification of algebras consisting of block Toeplitz matrices is a harder problem, that has received little attention up to now. We…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
We derive formulae for Gram matrices arising in the Nyman--Beurling reformulation of the Riemann hypothesis. The development naturally leads upon series of the form $S(x) = \sum_{n\ge 1} R(nx)$ and their reciprocity relations. We give…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Block Toeplitz matrices, using only matrix-vector products, and with a complexity of…
We will use overlays and templates derived from two-dimensional recurrence relations to build the arrays, and we will study the structure of the overlays, including initial conditions and basis arrays.
We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a…
In this study, a recursive solution technique in conjunction with generalized integrating factors is presented and applied to address first and second order linear differential equations. This approach demonstrates practical utility in…
The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…
If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be…
Working over an algebraically closed field $k$ of any characteristic, we determine the matrix factorizations for the --- suitably graded --- triangle singularities $f=x^a+y^b+z^c$ of domestic type, that is, we assume that $(a,b,c)$ are…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…