From monomials to words to graphs.

DOI10.1016/j.jcta.2003.11.001zbMath1060.20046arXivmath/0302252OpenAlexW2061565212MaRDI QIDQ598451

Arnaldo Mandel, Cristina G. Fernandes, Edward Lee Green

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0302252

zbMATH Keywords

Gröbner basespolynomialsNP-complete problemscomparability graphsblocking polyhedra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Free semigroups, generators and relations, word problems (20M05)

Related Items (1)

Word-Representable Graphs: a Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata and forbidden words
• An introduction to commutative and noncommutative Gröbner bases
• How to shell a monoid
• Forbidden words in symbolic dynamics
• Projective resolutions of straightening closed algebras generated by minors
• On the Homology of Associative Algebras
• Higher-order syzygies for the bracket algebra and for the ring of coordinates of the Grassmanian.
• Non-commutative Gröbner bases for commutative algebras
• The complexity of satisfiability problems
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: From monomials to words to graphs.