Genericity of Filling Elements

Details Genericity of Filling Elements Genericity of Filling Elements

2010-07-22

arxiv.org/abs/1007.4022v1

Mathematics

Group Theory

9 pages

Scientific paper

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling elements of F(X) is exponentially F(X)-generic in the sense of Arzhantseva and Ol'shanskii. We also provide an algebraic sufficient condition for an element to be filling and show that there exists an exponentially F(X)-generic subset of filling elements whose membership problem is solvable in linear time.

Affiliated with

Also associated with

No associations

Rating

Genericity of Filling Elements 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 Genericity of Filling Elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Genericity of Filling Elements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138360