The Intersection of $3$-Maximal Submonids

Giuseppa Castiglione; Štěpán Holub

doi:10.1016/j.tcs.2021.11.024

The Intersection of $3$-Maximal Submonids

Formal Languages and Automata Theory 2022-03-23 v1 Combinatorics

Authors: Giuseppa Castiglione , Štěpán Holub

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

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.

Cite

@article{arxiv.2008.01824,
  title  = {The Intersection of $3$-Maximal Submonids},
  author = {Giuseppa Castiglione and Štěpán Holub},
  journal= {arXiv preprint arXiv:2008.01824},
  year   = {2022}
}

Related papers

View all related →