arXiv · math/0302252
From Monomials to Words to graphs
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 Groebner 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 ordering 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel. 2003-02-20. From Monomials to Words to graphs. https://arxiv.org/abs/math/0302252
Cite the original work for its findings. Save a collection to share your selection of sources.