A poset classifying non-commutative term orders

Simple item page
dc.creatorSnellman, Jan
dc.date2002-01-10
dc.date.accessioned2026-07-07T06:29:33Z
dc.date.available2026-07-07T06:29:33Z
dc.descriptionWe study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. 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.
dc.identifierhttps://arxiv.org/abs/math/0201083
dc.identifierhttp://arxiv.org/abs/math/0201083
dc.identifierDiscrete Mathematics and Theoretical Computer Science (AA) 2001, pp 301-314
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/98068
dc.subjectCombinatorics
dc.subject06A15
dc.titleA poset classifying non-commutative term orders
dc.typetext

Files

Collections

arXiv