Add to ORKGWe study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix semigroup. We prove that matrix multiplication over nondistributive lattices is antiassociative, and we determine the invertible matrices in the case when the least or the greatest element of the lattice is irreducible
Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary...
In this paper we study multiplication lattice modules. Next we characterize hollow lattices modules....
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q ...
Residuated lattices simultaneously generalise lattice-ordered groups and the structures used to mode...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
A survey of the field of non-commutative algebra and arithmetic indicates that a great many of the r...
Multiplicative bases in matrix algebras Abstract: In a finite-dimensional algebra over a field F, a ...
AbstractIn a finite-dimensional algebra over a field F, a basis B is called a multiplicative basis p...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
AbstractUnlike factorization theory of commutative semigroups which are well-studied, very little li...
AbstractIn this paper, nilpotent subsemigroups in the matrix semigroup over a commutative antiring a...
AbstractIn a finite-dimensional algebra over a field F, a basis B is called a multiplicative basis p...
Let Mmn = Mmn (F) denote the set of all m x n matrices over a field F, and fix some n x m matrix A Є...
Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary...
In this paper we study multiplication lattice modules. Next we characterize hollow lattices modules....
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q ...
Residuated lattices simultaneously generalise lattice-ordered groups and the structures used to mode...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
A survey of the field of non-commutative algebra and arithmetic indicates that a great many of the r...
Multiplicative bases in matrix algebras Abstract: In a finite-dimensional algebra over a field F, a ...
AbstractIn a finite-dimensional algebra over a field F, a basis B is called a multiplicative basis p...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
AbstractUnlike factorization theory of commutative semigroups which are well-studied, very little li...
AbstractIn this paper, nilpotent subsemigroups in the matrix semigroup over a commutative antiring a...
AbstractIn a finite-dimensional algebra over a field F, a basis B is called a multiplicative basis p...
Let Mmn = Mmn (F) denote the set of all m x n matrices over a field F, and fix some n x m matrix A Є...
Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary...
In this paper we study multiplication lattice modules. Next we characterize hollow lattices modules....
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...