Logic Seminar
Justin Moore
Cornell
Fast Growth in the Folner Function for Thompson's Group $F$.
Abstract: While it is not known whether Thompson's group $F$ is amenable, I will
establish a lower bound on the cardinality of its Foelner sets. In
particular, I will demonstrate the following: There is a constant $C > 1$
such that if $A$ is a $C^{-n}$-Foelner set in $F$, then $A$ contains at
least $H(n)$ elements, where $H(0)=0$ and $H(n+1)=2^{H(n)}$.
Tuesday November 10, 2009 at 4:00 PM in SEO 612