| author: | Jan Snellman |
|---|---|
| title: | A Poset Classifying Non-Commutative Term Orders |
| keywords: | free associative algebra, term orders |
| abstract: | We study a poset N 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. |
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Jan Snellman (2001), A Poset Classifying Non-Commutative Term Orders, in Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, Robert Cori and Jacques Mazoyer and Michel Morvan and Rémy Mosseri (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AA, pp. 301-314 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAA0122.ps.gz (57 K) |
| ps-source: | dmAA0122.ps (151 K) |
| pdf-source: | dmAA0122.pdf (145 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.