arXiv Analytics

Sign in

arXiv:1705.09750 [math.CO]AbstractReferencesReviewsResources

Free monoids and generalized metric spaces

Mustapha Kabil, Maurice Pouzet, Ivo Rosenberg

Published 2017-05-27Version 1

Let $A$ be an ordered alphabet, $A^{\ast}$ be the free monoid over $A$ ordered by the Higman ordering, and let $F(A^{\ast})$ be the set of final segments of $A^{\ast}$. With the operation of concatenation, this set is a monoid. We show that the submonoid $F^{\circ}(A^{\ast}):= F(A^{\ast})\setminus \{\emptyset\}$ is free. The MacNeille completion $N(A^{\ast})$ of $A^{\ast}$ is a submonoid of $F(A^{\ast})$. As a corollary, we obtain that the monoid $N^{\circ}(A^{\ast}):=N(A^{\ast})\setminus \{\emptyset\}$ is free. We give an interpretation of the freeness of $F^{\circ}(A^{\ast})$ in the category of metric spaces over the Heyting algebra $V:= F(A^{\ast})$, with the non-expansive mappings as morphisms. Each final segment of $A^{\ast}$ yields the injective envelope $\mathcal S_F$ of a two-element metric space over $V$. The uniqueness of the decomposition of $F$ is due to the uniqueness of the block decomposition of the graph $\mathcal {G}_{F}$ associated to this injective envelope.

Comments: Submitted to the proceedings in the memory of Michel Deza
Categories: math.CO
Subjects: 06A15, 06D20, 46B85
Related articles: Most relevant | Search more
arXiv:1907.02231 [math.CO] (Published 2019-07-04)
Injective envelopes of transition systems and Ferrers languages
arXiv:1712.08516 [math.CO] (Published 2017-12-22)
A syntactic approach to the MacNeille completion of $\boldΛ^{\ast}$, the free monoid over an ordered alphabet $\bold Λ$
arXiv:1505.02695 [math.CO] (Published 2015-05-11)
Palindromic complexity of trees