Abstract
Abstract The paper is devoted to the study of equations with the left-hand side having the form of a composition of operations which belong to given sets S1, …, Sn, … of quasigroup operations. Elementary transformations are described which allow reducing systems of this kind to the form where all equations except one do not depend essentially on the variable xn. A class of systems is said to be Gaussian if every system obtained via such transformations also belongs to this class. It is evident that for Gaussian classes of systems of equations there is an efficient solving algorithm. This motivates the problem of finding conditions under which the class is Gaussian. In this work it is shown that for a class of systems to be Gaussian the operations in the sets Si should satisfy the generalized distributivity law. Sets of operations obeying this condition are to be investigated in the future.
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.
