Sign patterns that allow eventual positivity.
The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin squares are included, including the order eight Franklin subset which is of direct relevance...
The paper studies multilinear algebras, known as comtrans algebras, that are determined by so-called -Hermitian matrices over an arbitrary field. The main result of this paper shows that the comtrans algebra of -dimensional -Hermitian matrices furnishes a simple comtrans algebra.
Let and for . Max-algebra is an analogue of linear algebra developed on the pair of operations extended to matrices and vectors. The system of equations and inequalities have each been studied in the literature. We consider a problem consisting of these two systems and present necessary and sufficient conditions for its solvability. We also develop a polynomial algorithm for solving max-linear program whose constraints are max-linear equations and inequalities.
We consider simultaneous solutions of operator Sylvester equations (1 ≤ i ≤ k), where and are commuting k-tuples of bounded linear operators on Banach spaces and ℱ, respectively, and is a (compatible) k-tuple of bounded linear operators from ℱ to , and prove that if the joint Taylor spectra of and do not intersect, then this system of Sylvester equations has a unique simultaneous solution.
Assume that K is an arbitrary field. Let (I,⪯) be a poset of finite prinjective type and let KI be the incidence K-algebra of I. A classification of all sincere posets of finite prinjective type with three maximal elements is given in Theorem 2.1. A complete list of such posets consisting of 90 diagrams is presented in Tables 2.2. Moreover, given any sincere poset I of finite prinjective type with three maximal elements, a complete set of pairwise non-isomorphic sincere indecomposable prinjective...
Existence and uniqueness conditions for solving singular initial and two-point boundary value problems for discrete generalized Lyapunov matrix equations and explicit expressions of solutions are given.
A matrix A ∈ ℝn×n is a GM-matrix if A = sI − B, where 0 < ρ(B) ≤ s and B ∈WPFn i.e., both B and Bt have ρ(B) as their eigenvalues and their corresponding eigenvector is entry wise nonnegative. In this article, we consider a generalization of a subclass of GM-matrices having a nonnegative core nilpotent decomposition and prove a characterization result for such matrices. Also, we study various notions of splitting of matrices from this new class and obtain sufficient conditions for their convergence....