1992•International Journal of Computer MathematicsRequires access

The lattice of semiretracts of a free monoid

James Anderson, Tom Head

Open publisher page 5 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Monoid, Retract, Mathematics, Lattice (music), Free monoid, Partially ordered set, Combinatorics, Generalization

Related papers

Back to paper searchBrowse research topicsOriginal source
The lattice of semiretracts of a free monoid — Research Paper | ScholarLens