The lattice of semiretracts of a free monoid
James Anderson, Tom Head
Abstract
James Anderson, Tom Head
Abstract
The poset of retracts of a free monoid F is a lattice only when F is generated by three or fewer elements. We extend this result by widening attention from the retracts of F to the finite intersections of retracts, which we call semiretracts. When F is generated by three or fewer elements every semiretract is a retract. We obtain the desired generalization: The semiretracts of a finitely generated free monoid form a complete lattice. Moreover, each such lattice satisfies the ascending and descending chain conditions. These results are demonstrated through the use of special features of the minimal generating sets of retracts of free monoids.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The poset of retracts of a free monoid F is a lattice only when F is generated by three or fewer elements. We extend this result by widening attention from the retracts of F to the finite intersections of retracts, which we call semiretracts. When F is generated by three or fewer elements every semiretract is a retract. We obtain the desired generalization: The semiretracts of a finitely generated free monoid form a complete lattice. Moreover, each such lattice satisfies the ascending and descending chain conditions. These results are demonstrated through the use of special features of the minimal generating sets of retracts of free monoids.
Key concepts: Monoid, Retract, Mathematics, Lattice (music), Free monoid, Partially ordered set, Combinatorics, Generalization