| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9493502 | Journal of Algebra | 2005 | 39 Pages |
Abstract
Several constructions exist for the free inverse semigroup FIX with a set X of free generators. We offer a new construction that describes elements of FIX as shortest words in the classes of equivalent words over the alphabet XâªXâ1 and produce an algorithm that transforms any word into its shortest equivalent form. Both known and new properties of FIX follow.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Olga Poliakova, Boris M. Schein,