Abstract

Given a finite alphabet X and an ordering ≺ on the letters, the map σ ≺ sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Gröbner bases, we characterize ideals I in the free commutative monoid (in terms of a generating set) such that the ideal 〈 σ ≺( I)〉 generated by σ ≺( I) in the free monoid is finitely generated. Whether there exists an ≺ such that 〈 σ ≺( I)〉 is finitely generated turns out to be NP-complete. The latter problem is closely related to the recognition problem for comparability graphs.

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 call

Disclaimer: 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.