arXiv subjects

Claire Wladis

Publications and source records attributed to Claire Wladis.

2 recordsLinked to original sources

arXiv2009

The word problem and the metric for the Thompson-Stein groups

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of elements may not be unique when k>1. We establish how to find minimal tree-pair diagram representatives of elements of F(n_1,...,n_k), and we prove several theorems describing the equivalence of trees and tree-pair diagrams. We introduce a unique normal form for elements of F(n_1,...,n_k) (with respect to the standard infinite generating set developed by Melanie Stein) which provides a solution to the word problem, and we give sharp upper and lower bounds on the metric with respect to the standard finite generating set, showing that in the case k>1, the metric is not quasi-isometric to the number of leaves or caret in the minimal tree-pair diagram, as is the case when k=1.

math.GR↗

arXiv2008

Unusual Geodesics in generalizations of Thompson's Group F

We prove that seesaw words exist in Thompson's Group F(N) for N=2,3,4,... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g^k or g^{-k} (for given g\in X) and at least one geodesic representative of each type. The existence of seesaw words with arbitrarily large swing guarantees that F(N) is neither synchronously combable nor has a regular language of geodesics. Additionally, we prove that dead ends (or k--pockets) exist in F(N) with respect to X and all have depth 2. A dead end w is a word for which no geodesic path in the Cayley graph Γwhich passes through w can continue past w, and the depth of w is the minimal m\in\mathbb{N} such that a path of length m+1 exists beginning at w and leaving B_{|w|}. We represent elements of F(N) by tree-pair diagrams so that we can use Fordham's metric. This paper generalizes results by Cleary and Taback, who proved the case N=2.

math.GR↗