Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cylinders, multi-cylinders and the induced action of Aut( F n )

Cylinders, multi-cylinders and the induced action of Aut( F n ) Abstract. A cylinder is the set of infinite words with fixed prefix u . A double-cylinder is “the same” for bi-infinite words. We show that for every word u and any automorphism of the free group F the image is a finite union of cylinders. The analogous statement is true for double cylinders. We give (a) an algorithm, and (b) a precise formula which allows one to determine this finite union of cylinders. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Cylinders, multi-cylinders and the induced action of Aut( F n )

Groups - Complexity - Cryptology , Volume 4 (2) – Dec 1, 2012

Loading next page...
 
/lp/de-gruyter/cylinders-multi-cylinders-and-the-induced-action-of-aut-f-n-OsI1FNkmYs
Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2012-0017
Publisher site
See Article on Publisher Site

Abstract

Abstract. A cylinder is the set of infinite words with fixed prefix u . A double-cylinder is “the same” for bi-infinite words. We show that for every word u and any automorphism of the free group F the image is a finite union of cylinders. The analogous statement is true for double cylinders. We give (a) an algorithm, and (b) a precise formula which allows one to determine this finite union of cylinders.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Dec 1, 2012

There are no references for this article.