Abstract
In this work we develop a framework to decrease the time complexity of well-known algorithms to compute the generator sets of a semigroup ideal by using the Hermite normal form. We introduce idea of decomposable semigroups, which fulfills that the computation of its ideal can be achieved by separately calculating over smaller semigroups, products of the decomposition. Our approach does not only decrease the time complexity of the problem, but also allows using parallel computational techniques. A combinatorial characterization of these semigroups is obtained and the concept of decomposable variety is introduced. Finally, some applications and practical results are provided.
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.
