Left-right pairs and complex forests of infinite rooted binary trees

Abstract: Let

m a t h c a l D_{0} := x + i y v e r t x, y > 0

, and let

(L, R)

be a pair of M"{o}bius transformations corresponding to

m a t h r m {S L}_{2} (m a t h b b N_{0})

matrices such that

R (m a t h c a l D_{0})

and

L (m a t h c a l D_{0})

are disjoint. Given such a pair (called a left-right pair), we can construct a directed graph

m a t h c a l F (L, R)

with vertices

m a t h c a l D_{0}

and edges

{(z, R (z))}_{z i n m a t h c a l D_{0}} c u p {(z, L (z))}_{z i n m a t h c a l D_{0}}

, which is a collection of infinite binary trees. We answer two questions of Nathanson by classifying all the pairs of elements of

m a t h r m {S L}_{2} (m a t h b b N_{0})

whose corresponding M"{o}bius transformations form left-right pairs and showing that trees in

m a t h c a l F (L, R)

are always rooted.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: Left-right pairs and complex forests of infinite rooted binary trees