Jan Snellman
-
A Poset Classifying Non-Commutative Term Orders
dmtcs:2286 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2001,
DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
-
https://doi.org/10.46298/dmtcs.2286A Poset Classifying Non-Commutative Term OrdersConference paperAuthors: Jan Snellman
1
0009-0002-6676-5068
Jan Snellman
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.
Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Section: Proceedings
Published on: January 1, 2001
Imported on: November 21, 2016
Keywords: [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], [en] term orders, free associative algebra