From monomials to words to graphs

Authors:
Cristina G. Fernandes;Edward L. Green;Arnaldo Mandel
Affiliations:
Departamento de Ciência da Computação, Universidade de São Paulo, São Paulo, SP, 05508-970, Brazil;Mathematics Department, Virginia Tech University;Departamento de Ciência da Computação, Universidade de São Paulo, São Paulo, SP, 05508-970, Brazil
Venue:
Journal of Combinatorial Theory Series A
Year:
2004

Citing 7
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
An introduction to commutative and noncommutative Gro¨bner bases

Selected papers of the second international colloquium on Words, languages and combinatorics
Automata and forbidden words

Information Processing Letters
Regular Article: Forbidden Words in Symbolic Dynamics

Advances in Applied Mathematics
Elements of the Theory of Computation

Elements of the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.