Abstract
Some concepts in semigroup theory are interpreted in discrete structures such as finite lattices, binary relations, and finite semilattices. An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. By analogy with the linear spaces in the linear algebra semilattice homomorphisms, isomorphisms, projections on Boolean vector spaces are defined and some properties of them are investigated in detail. Maps, corresponding to them in the linear algebra, are connected with matrices and their pseudouinverse. Important properties of these maps, which are essential for solving linear systems, remain the same in the Boolean vector spaces. Stochastic experiments using the maps defined and computer algebra methods have been made for solving linear equations Ax = b. The Hamming distance between b and the projection p(b) = Ax of b is equal or close to the least possible one, if the system has no solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
