Decomposition theorem for invertible substitutions on three-letter alphabet

Details Decomposition theorem for invertible substitutions on three-letter alphabet Decomposition theorem for invertible substitutions on three-letter alphabet

2002-10-17

arxiv.org/abs/math/0210262v1

Mathematics

Group Theory

18 pages,pdf

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Decomposition theorem for invertible substitutions on three-letter alphabet does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition theorem for invertible substitutions on three-letter alphabet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition theorem for invertible substitutions on three-letter alphabet will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671888