Skip to Main content Skip to Navigation
Conference papers

A Poset Classifying Non-Commutative Term Orders

Abstract : 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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01182966
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 11:28:03 AM
Last modification on : Tuesday, March 7, 2017 - 3:00:10 PM
Long-term archiving on: : Friday, May 5, 2017 - 11:23:26 AM

File

dmAA0122.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01182966, version 1

Collections

Citation

Jan Snellman. A Poset Classifying Non-Commutative Term Orders. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.301-314. ⟨hal-01182966⟩

Share

Metrics

Record views

86

Files downloads

700