AbstractA matrix is called a lattice matrix if its elements belong to a distributive lattice. For a lattice matrix A of order n, if there exists an n×n permutation matrix P such that F=PAPT=(fij) satisfies fij≮fji for i>j, then F is called a canonical form of A. In this paper, the transitivity of powers and the transitive closure of a lattice matrix are studied, and the convergence of powers of transitive lattice matrices is considered. Also, the problem of the canonical form of a transitive lattice matrix is further discussed
AbstractLattice matrices are 0/1-matrices used in the description of certain lattice polyhedra and r...
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q ...
Two independent approaches to the theory of the lattice rule have been exploited at length in the li...
AbstractA matrix is called a lattice matrix if its elements belong to a distributive lattice. For a ...
Abstract. Much of the elementary theory of lattice rules may be presented as an elegant application ...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
In this paper, the nilpotent matrices over distributive lattices are discussed by applying the combi...
This paper deals with the characteristic roots of different types of lattice matrices and proves tha...
Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiri...
We address classification of permutation matrices, in terms of permutation similarity relations, whi...
This thesis is concerned with two, rather different, areas of analysis. A major part is...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
In this paper, we investigate the relation between a structural matrix algebra and the lattice prope...
AbstractLattice matrices are 0/1-matrices used in the description of certain lattice polyhedra and r...
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q ...
Two independent approaches to the theory of the lattice rule have been exploited at length in the li...
AbstractA matrix is called a lattice matrix if its elements belong to a distributive lattice. For a ...
Abstract. Much of the elementary theory of lattice rules may be presented as an elegant application ...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
In this paper, the nilpotent matrices over distributive lattices are discussed by applying the combi...
This paper deals with the characteristic roots of different types of lattice matrices and proves tha...
Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiri...
We address classification of permutation matrices, in terms of permutation similarity relations, whi...
This thesis is concerned with two, rather different, areas of analysis. A major part is...
summary:In this paper, the concepts of indecomposable matrices and fully indecomposable matrices ove...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
In this paper, we investigate the relation between a structural matrix algebra and the lattice prope...
AbstractLattice matrices are 0/1-matrices used in the description of certain lattice polyhedra and r...
Let L be a distributive lattice and Mn,q (L)(Mn(L), resp.) the semigroup (semiring, resp.) of n × q ...
Two independent approaches to the theory of the lattice rule have been exploited at length in the li...