A Poset Classifying Non-Commutative Term Orders
Snellman, Jan
HAL, hal-01182966 / Harvested from HAL
Text on HAL
We study a poset $\Re$ on the free monoid (X*) on a countable alphabet X.This poset is determined by the fact that its total extensions are precisely the standard term orders on X*. 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.
Publié le : 2001-07-04
Classification:  term orders,  free associative algebra,  [INFO]Computer Science [cs],  [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG],  [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],  [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC] 
@article{hal-01182966,
     author = {Snellman, Jan},
     title = {A Poset Classifying Non-Commutative Term Orders},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01182966}
}

Snellman, Jan. A Poset Classifying Non-Commutative Term Orders. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-01182966/