FLJul 12, 2024
Commuting upper triangular binary morphisms
arXiv:2302.06158h-index: 11
Originality Synthesis-oriented
AI Analysis
This solves a classification problem in combinatorics on words for a specific class of morphisms, which is an incremental theoretical contribution.
The paper characterizes all pairs of upper triangular binary morphisms that commute, providing a complete classification of such commuting pairs.
A morphism $g$ from the free monoid $X^*$ into itself is called upper triangular if the matrix of $g$ is upper triangular. We characterize all upper triangular binary morphisms $g_1$ and $g_2$ such that $g_1g_2=g_2g_1$.