On solvability of some types of matrix equations over lattices (Q1760496): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5705669 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Invertible matrices over distributive lattices / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0037446612020048 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061792772 / rank | |||
Normal rank |
Latest revision as of 11:24, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On solvability of some types of matrix equations over lattices |
scientific article |
Statements
On solvability of some types of matrix equations over lattices (English)
0 references
14 November 2012
0 references
A partially ordered set \(L\) with top and bottom elements 0 and 1 and the meet and join operations is considered here. A matrix with entries in such a lattice \(L\) is called a matrix over \(L\). The set of all such \(m\) by \(n\) matrices is partially ordered by elementwise entry order and addition and multiplication of such matrices is defined via lattice join and lattice meet, respectively. The paper considers the matrix equations \(AX = B\) and \(XA = B\) for matrices over a distributive or Boolean lattice \(L\) and finds the greatest solution in either of the four cases. More specific results are proved for matrices over \(L\) whose entries, rows or columns form an orthogonal system.
0 references
lattice
0 references
matrix over a lattice
0 references
greatest solution
0 references
matrix equation
0 references
partial order
0 references
Boolean lattice
0 references