From Monomials to Words to graphs
Cristina G. Fernandes, Edward L. Green, Arnaldo Mandel
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.
Create a lesson
Related papers
On the Stable category of maximal Cohen-Macaulay modules over Gorenstein rings-II
Tony J. Puthenpurakal
Symbolic powers of the ideal ofn general points in Pn-1
Ralf Fröberg, Boris Shapiro
Density functions for filtrations of graded ideals
Suprajo Das, Hoang Le Truong
Finitistic injective dimension exceeding finitistic projective dimension for a commutative ring
Liang Chen
A criterion for determinantal presentations of numerical semigroup rings
Satoshi Murai, Kou Takahashi
Normality of ideals beyond the standard graded setting: families from numerical semigroup rings
Naoyuki Matsuoka