Solving a family of permutation problems on 0-1 matrices
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
This article describes definitions of subsymmetric matrix, anti-subsymmetric matrix, central symmetric matrix, symmetry circulant matrix and their basic properties.
Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem. It is proved that these sequences are monotone increasing, and numerical examples are given to show that these sequences could reach the true value of the minimum eigenvalue in some cases. These results in this paper improve some known results.
Mathematical Subject Classification 2010:26A33, 33E99, 15A52, 62E15.Mittag-Leffler functions and their generalizations appear in a large variety of problems in different areas. When we move from total differential equations to fractional equations Mittag-Leffler functions come in naturally. Fractional reaction-diffusion problems in physical sciences and general input-output models in other disciplines are some of the examples in this direction. Some basic properties of Mittag-Leffler functions are...
Stępniak [Linear Algebra Appl. 151 (1991)] considered the problem of equivalence of the Löwner partial order of nonnegative definite matrices and the Löwner partial order of squares of those matrices. The paper was an important starting point for investigations of the problem of how an order between two matrices A and B from different sets of matrices can be preserved for the squares of the corresponding matrices A² and B², in the sense of the Löwner partial ordering, the star partial ordering,...