we derive the formulas of the maximal andminimal ranks of four real matrices $x_{1},x_{2},x_{3}$ and $x_{4}$in common solution $x=x_{1}+x_{2}i+x_{3}j+x_{4}k$ to quaternionmatrix equations $a_{1}x=c_{1},xb_{2}=c_{2},a_{3}xb_{3}=c_{3}$. asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. we give the exp...

we derive the formulas of the maximal andminimal ranks of four real matrices $x_{1},x_{2},x_{3}$ and $x_{4}$in common solution $x=x_{1}+x_{2}i+x_{3}j+x_{4}k$ to quaternionmatrix equations $a_{1}x=c_{1},xb_{2}=c_{2},a_{3}xb_{3}=c_{3}$. asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. we give the exp...

the length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using quasi monte carlo(qmc) simulation and cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in horest power.

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

With a grading previously introduced by the second-named author, the multiplication maps in the preprojective algebra satisfy a maximal rank property that is similar to the maximal rank property proven by Hochster and Laksov for the multiplication maps in the commutative polynomial ring. The result follows from a more general theorem about the maximal rank property of a minimal almost split mor...

In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...

We study paths between maximal chains, or “flags,” in finite rank semimodular lattices. Two flags are adjacent if they differ on at most one rank. A path is a sequence of flags in which consecutive flags are adjacent. We study the union of all flags on at least one minimum length path connecting two flags in the lattice. This is a subposet of the original lattice. If the lattice is modular, the...