A poset classifying non-commutative term orders

Details A poset classifying non-commutative term orders A poset classifying non-commutative term orders

2002-01-10

arxiv.org/abs/math/0201083v1

Discrete Mathematics and Theoretical Computer Science (AA) 2001, pp 301-314

Mathematics

Combinatorics

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

A poset classifying non-commutative term orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A poset classifying non-commutative term orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A poset classifying non-commutative term orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201304