Some properties of the Kronecker maps are deduced. It is shown that many kinds of matrix equations can be formulated into the so-called Sylvester-polynomial matrix equations. With the help of the ...

Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science. In this paper, our goal is to propose a non-algebraic ...

Abstract: The Laplacian matrices of graphs are fundamental. In addition to facilitating the application of linear algebra to graph theory, they arise in many practical problems. In this talk we survey ...