Results 21 to 30 of about 606 (79)
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
A geometric approach to alternating $k$-linear forms [PDF]
Given an $n$-dimensional vector space $V$ over a field $\mathbb K$, let $2\leq k < n$. There is a natural correspondence between the alternating $k$-linear forms $\varphi$ of $V$ and the linear functionals $f$ of $\bigwedge^kV$.
Cardinali, Ilaria+2 more
core +2 more sources
Hypersymmetric functions and Pochhammers of 2 × 2 nonautonomous matrices
We introduce the hypersymmetric functions of 2 × 2 nonautonomous matrices and show that they are related, by simple expressions, to the Pochhammers (factorial polynomials) of these matrices. The hypersymmetric functions are generalizations of the associated elementary symmetric functions, and for a specific class of 2 × 2 matrices, having a high degree
A. F. Antippa
wiley +1 more source
The core inverse and constrained matrix approximation problem
In this article, we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse:||Mx−b||F=minsubjecttox∈ℛ(M),||Mx-b|{|}_{F}=\hspace{.25em}\min \hspace{1em}\text{subject}\hspace{.25em}\text{to}\hspace{1em}x\in ...
Wang Hongxing, Zhang Xiaoyan
doaj +1 more source
Generalization of Roth's solvability criteria to systems of matrix equations [PDF]
W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B. K{\aa}gstr\"om
Dmytryshyn, Andrii+3 more
core +3 more sources
Maximizing the determinant for a special class of block‐partitioned matrices
An analytical solution is found for the maximum determinant of a block‐partitioned class of matrices with constant trace for each block. As an immediate application of this result, the maximum determinant of a sum of Kronecker products is derived.
Otilia Popescu+2 more
wiley +1 more source
In this paper, we introduce the weak group inverse (called as the WG inverse in the present paper) for square complex matrices of an arbitrary index, and give some of its characterizations and properties.
Wang Hongxing, Chen Jianlong
doaj +1 more source
Direct methods for matrix Sylvester and Lyapunov equations
We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: the Bartels‐Stewart method for A1X + XA2 + D = 0 and Hammarling′s method for AX + XAT + BBT = 0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank‐1 updating scheme in Hammarling′s method.
Danny C. Sorensen, Yunkai Zhou
wiley +1 more source
The Cayley transform of Banach algebras
The main result of Haynes (1991) is that a square matrix is convergent (limn→∞Dn = 0) if and only if it is the Cayley transform CA = (I−A)−1(I + A) of a stable matrix A. In this note, we show, with a simple proof, that the above is true in a much more general setting of complex Banach algebras.
Zhidong Pan
wiley +1 more source
Invariance of recurrence sequences under a galois group
Let F be a Galois field of order q, k a fixed positive integer and R = Fk×k[D] where D is an indeterminate. Let L be a field extension of F of degree k. We identify Lf with fk×1 via a fixed normal basis B of L over F. The F‐vector space Γk(F)( = Γ(L)) of all sequences over Fk×1 is a left R‐module. For any regular f(D) ∈ R, Ωk(f(D)) = {S ∈ Γk(F) : f(D)S
Hassan Al-Zaid, Surjeet Singh
wiley +1 more source