A poset classifying non-commutative term orders
Combinatorics
2007-05-23 v1
Abstract
We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard term orders, and the poset classifying sorted term orders. For the latter poset, we give a Galois coconnection with the Young lattice.
Keywords
Cite
@article{arxiv.math/0201083,
title = {A poset classifying non-commutative term orders},
author = {Jan Snellman},
journal= {arXiv preprint arXiv:math/0201083},
year = {2007}
}