BINGHAMTON GEOMETRY/TOPOLOGY SEMINAR<br><div class="gmail_quote"><div class="gmail_quote"><div class="gmail_quote"><div class="gmail_quote"><div class="gmail_quote"><div class="gmail_quote"><br>The room for the third talk of the week has been finalized: LN-2201. See also the abstract below.<br>
<br>
<br><i>Date:</i> <b>Wednesday</b>, March 30, 2011<br>
<i>Time:</i> <b>3:30-4:30pm</b><br>
<i>Place:</i> Library North 2205 preceded by coffee/tea in the Anderson Reading Room.<br>
<i>Speaker:</i> Collin Bleak (St. Andrews)<br>
<i>Title:</i>
Minimal nonsolvable subgroups of F<br>
<br><div class="gmail_quote"><i>Abstract:</i> In previous work, we
showed that every non-solvable subgroup of F contains a copy of a
particular, countably generated (and not finitely generated!)
non-solvable subgroup W. In turn, W contains copies of every solvable
subgroup of F. In this talk, we consider what happens for finitely
generated non-solvable subgroups of F. We show that a particular,
2-generated, non-solvable group B (as in, `Brin's group B') has the
property that every finitely generated non-solvable subgroup of F has a
copy of B within it.<br></div><br><i><br>Date:</i> Thursday, March 31, 2011<br><i>Time:</i> 2:50-3:50pm<br><i>Place:</i> Library North 2205 followed by coffee/tea in the Anderson Reading Room.<br>
<i>Speaker:</i> Chris Cashen (U Utah)<br><i>Title:</i> Line Patterns in Free Groups<br><br>
<i>Abstract:</i> Consider a
collection of closed curves in a finite graph. The universal cover of
the graph is a tree, and the lifts of the closed curves make a pattern
of lines in this tree. I will discuss when it is possible to match up
two such line patterns with a quasi-isometriy of the tree.<br><br><br><i><br>Date:</i> <b>Friday</b>, April 1, 2011<br>
<i>Time:</i> <b>3:30-4:30pm</b><br>
<i>Place:</i> Library North 2201 preceded by coffee/tea in the Anderson Reading Room.<br>
<i>Speaker:</i> Collin Bleak (St. Andrews)<br>
<i>Title:</i> On the Automorphisms of Thompson's Group V_n<br><br><i>Abstract:</i> We use a theorem of Grigorchuk and Nekrashevych, and some
automata theory (and if desired, even some basic analysis) to show that
the outer automorphism group of the generalized Thompson group V_n is
S_n, the symmetric group on n letters. We also describe some likely
consequences of this result. Joint with Lanoue, Maissel, and Navas.<br>
</div></div></div></div></div>
</div><br>