Decomposition theorem for invertible substitutions on three-letter alphabet

Simple item page
dc.creatorTan, B.
dc.creatorWen, Z. -X.
dc.creatorZhang, Y. -P.
dc.date2002-10-17
dc.date.accessioned2026-07-07T04:52:03Z
dc.date.available2026-07-07T04:52:03Z
dc.descriptionWe shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's substitution. As a consequence, a matrix (of order 3 and with non-negative integral coefficients) is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices.
dc.description18 pages,pdf
dc.identifierhttps://arxiv.org/abs/math/0210262
dc.identifierhttp://arxiv.org/abs/math/0210262
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65328
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.subject20M05, 68R15
dc.titleDecomposition theorem for invertible substitutions on three-letter alphabet
dc.typetext

Files

Collections

arXiv