Abstract
Systems of linear equations of the form A⊗ x = b over a discrete bottleneck algebra ( B, ⊕, ⊗, ⩽), where ⊕ = max and ⊗ = min, are studied. A square matrix A is said to be strongly regular if for some vector b the system A⊗ x = b is uniquely solvable. A necessary and sufficient condition for strong regularity is proved, together with an O( n 2log n) method for testing this property.
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.
