Related papers: Non-Expansive Matrix Based number Systems

We consider partial and total reduction of a nonhomogeneous linear system of the operator equations with the system matrix in the same particular form as in paper [N. Shayanfar, M. Hadizadeh 2013]. Here we present two different concepts.…

Let $G$ be a classical group with natural module $V$ over an algebraically closed field of good characteristic. For every unipotent element $u$ of $G$, we describe the Jordan block sizes of $u$ on the irreducible $G$-modules which occur as…

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

The eigenvalue equation of a band or a block tridiagonal matrix, the tight binding model for a crystal, a molecule, or a particle in a lattice with random potential or hopping amplitudes: these and other problems lead to three-term…

We analyze several versions of Jacobi's method for the symmetric eigenvalue problem. Our goal is to reduce the asymptotic cost of the algorithm as much as possible, as measured by the number of arithmetic operations performed and associated…

A square matrix $A$ has the usual Jordan canonical form that describes the structure of $A$ via eigenvalues and the corresponding Jordan blocks. If $A$ is a linear relation in a finite-dimensional linear space ${\mathfrak H}$ (i.e., $A$ is…

We present a generalisation of the pseudoinverse operation to pairs of matrices, as opposed to single matrices alone. We note the fact that the Singular Value Decomposition can be used to compute the ordinary Moore-Penrose pseudoinverse. We…

In this article we begin the study of representations of simple finite-dimensional noncommutative Jordan superalgebras. In the case of degree $\geq 3$ we show that any finite-dimensional representation is completely reducible and, depending…

Block copolymer, a synthesized polymer material, has found many applications in industry. It is consisting of multiple sequences of monomer alternating in series with different monomer blocks. The combination of different polymers endows…

D. Benkovi\v{c} described Jordan homomorphisms of algebras of triangular matrices over a commutative unital ring without additive $2$-torsion. We extend this result to the case of noncommutative rings and remove the assumption of additive…

We study the eigenvalue distribution of a large Jordan block subject to a small random Gaussian perturbation. A result by E.B. Davies and M. Hager shows that as the dimension of the matrix gets large, with probability close to $1$, most of…

We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in…

Let $K$ be an algebraically closed field that is complete with respect to a non-Archimedean absolute value, and let $\varphi\in K(z)$ have degree $d\geq 2$. We characterize maps for which the minimal resultant of an iterate $\varphi^n$ is…

Let $T$ be a tree with a vertex set $\{ 1,2,\dots, N \}$. Denote by $d_{ij}$ the distance between vertices $i$ and $j$. In this paper, we present an explicit combinatorial formula of principal minors of the matrix $(t^{d_{ij}})$, and its…

We consider the regularization of matrices $M^N$ written in Jordan form by additive Gaussian noise $N^{-\gamma}G^N$, where $G^N$ is a matrix of i.i.d. standard Gaussians and $\gamma>1/2$ so that the operator norm of the additive noise tends…

We study Jacobi matrices with $N$-periodically modulated recurrence coefficients when the sequence of $N$-step transfer matrices is convergent to a non-trivial Jordan block. In particular, we describe asymptotic behavior of their…

We present a procedure to extract the generalised eigenvectors of a non-diagonalisable matrix by considering a diagonalisable perturbation of it and computing the non-diagonalisable limit of its eigenvectors. As an example of this process,…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

We study two matrices $N$ and $M$ defined by the parameters of equivalent $S$- and $J$-continued fraction expansions, and compare them by examining the product $N^{-1}M$. Using examples based on the Catalan numbers, the little Schr\"oder…

In this paper we study two dimensional minimal linear code over the ring $\mathbb{Z}_{p^n}$(where $p$ is prime). We show that if the generator matrix $G$ of the two dimensional linear code $M$ contains $p^n+p^{n-1}$ column vector of the…