Schützenberger-like products in non-free monoids
Roman R. Redziejowski (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Roman R. Redziejowski (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Blanchet-Sadri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Johannes Arz (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Blanchet-Sadri (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Klaus Madlener, Friedrich Otto (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Howard Straubing (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Arkowitz, Martin, Gutierrez, Mauricio (1997)
International Journal of Mathematics and Mathematical Sciences
Similarity:
T. Head (1979)
Semigroup forum
Similarity:
Scott T. Chapman, Felix Gotti, Roberto Pelayo (2014)
Colloquium Mathematicae
Similarity:
Let M be a commutative cancellative monoid. The set Δ(M), which consists of all positive integers which are distances between consecutive factorization lengths of elements in M, is a widely studied object in the theory of nonunique factorizations. If M is a Krull monoid with cyclic class group of order n ≥ 3, then it is well-known that Δ(M) ⊆ {1,..., n-2}. Moreover, equality holds for this containment when each class contains a prime divisor from M. In this note, we consider the question...