Automata computation of branching laws for endomorphisms of Cuntz algebras

Details Automata computation of branching laws for endomorphisms of Cuntz algebras Automata computation of branching laws for endomorphisms of Cuntz algebras

2006-01-30

arxiv.org/abs/math/0601716v1

Mathematics

Operator Algebras

Scientific paper

In our previous articles, we have presented a class of endomorphisms of the Cuntz algebras which are defined by polynomials of canonical generators and their conjugates. We showed the classification of some case under unitary equivalence by help of branching laws of permutative representations. In this article, we construct an automaton which is called the Mealy machine associated with the endomorphism in order to compute its branching law. We show that the branching law is obtained as outputs from the machine for the input of information of a given representation.

Affiliated with

Also associated with

No associations

Rating

Automata computation of branching laws for endomorphisms of Cuntz algebras 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 Automata computation of branching laws for endomorphisms of Cuntz algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automata computation of branching laws for endomorphisms of Cuntz algebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14362