Multiple Conjugacy Search Problem in Limit Groups

Zoe O'Connor (Herriot-Watt)

Wednesday 13th February, 2013 16:00-17:00 204


The multiple CSP is the following: Given two conjugate lists of elements A=[a_1,a_2,...,a_n] and B=[b_1,b_2,...,b_n], can we find a conjugator x such that x^{-1}a_{i}x=b_i? We show that one can put a linear upper bound on the geodesic length of a shortest conjugator.

Add to your calendar

Download event information as iCalendar file (only this event)