A Poset Classifying Non-Commutative Term Orders - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

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.
Fichier principal
Vignette du fichier
dmAA0122.pdf (141.71 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01182966 , version 1 (06-08-2015)

Identifiers

Cite

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

Collections

TDS-MACS
33 View
691 Download

Altmetric

Share

Gmail Facebook X LinkedIn More