10.46298/dmtcs.2286
https://dmtcs.episciences.org/2286
Snellman, Jan
Jan
Snellman
A Poset Classifying Non-Commutative Term Orders
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.
episciences.org
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]
2023-01-30
2001-01-01
2001-01-01
en
journal article
https://hal.science/hal-01182966v1
1365-8050
https://dmtcs.episciences.org/2286/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Proceedings
Researchers
Students