6533b7d3fe1ef96bd1260af5
RESEARCH PRODUCT
The Intersection of $3$-Maximal Submonids
Giuseppa CastiglioneŠTěpán Holubsubject
Free graphSettore INF/01 - InformaticaGeneral Computer ScienceMathematics::Category Theory3-maximal monoidsMathematics - CombinatoricsComputer Science - Formal Languages and Automata Theory68R15IntersectionTheoretical Computer Sciencedescription
Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2020-08-04 |