GENERICITY OF FILLING ELEMENTS

Abstract

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 minimal isometric action of F(X) on an ℝ-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'shanskiı. We also provide an algebraic sufficient condition for an element to be filling and show that there exists an exponentially F(X)-generic subset consisting only of filling elements and whose membership problem has linear time complexity.