{"docId":2286,"paperId":2286,"url":"https:\/\/dmtcs.episciences.org\/2286","doi":"10.46298\/dmtcs.2286","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":246,"name":"DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)"}],"section":[{"sid":66,"title":"Proceedings","description":[]}],"repositoryName":"Hal","repositoryIdentifier":"hal-01182966","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-01182966v1","dateSubmitted":"2016-11-21 15:43:19","dateAccepted":null,"datePublished":"2001-01-01 00:00:00","titles":{"en":"A Poset Classifying Non-Commutative Term Orders"},"authors":["Snellman, Jan"],"abstracts":{"en":"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."},"keywords":[["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]"]}