<div dir="ltr"><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">Sayin Liste Üyeleri,</font></span><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">Gebze Teknik Üniversitesi (GTÜ) Matematik Bölümü Genel Seminerleri kapsamında, 13 Mart Cuma günü saat 14:00'da Şükrü Yalçınkaya (İstanbul Üniversitesi) bir seminer verecektir. Seminerin detayları aşağıda olup tüm ilgilenenler davetlidir.</font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">Saygılarımızla.</font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4"><br></font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">Dear all,</font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">There will be a seminar in Gebze Technical University (GTU) on 13th of March by Şükrü Yalçınkaya (İstanbul University).</font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4"><br></font></span></div><div><span style="color:rgb(0,0,0);font-family:"Times New Roman""><font size="4">Time and place: At 14:00 in Department of Mathematics, Lecture Room 3</font></span></div><div><font size="4"><span style="color:rgb(0,0,0);font-family:"Times New Roman""><br></span></font></div><div><font size="4"><span style="color:rgb(0,0,0);font-family:"Times New Roman"">Title: Recognition Al</span><span style="color:rgb(0,0,0);font-family:"Times New Roman"">gorithms for Finite Groups</span></font></div><div><font size="4"><span style="color:rgb(0,0,0);font-family:"Times New Roman""><br></span></font></div><div><font size="4"><span style="color:rgb(0,0,0);font-family:"Times New Roman"">Abstract:</span> <font face="times new roman, serif">Over the last few decades, there has been a major interest in computational
group theory to produce efficient recognition algorithms for matrix groups over
finite fields. In this talk, I will focus on the black box set up, that is, the
groups are encrypted in 0-1 strings of uniform length, and group operations,
taking inverses and comparing elements for equality are performed by a black
box. I will discuss the fundamental difficulties in matrix groups and present a
uniform approach for an efficient recognition of finite groups of Lie type of odd
characteristic. I will also discuss a solution of a long standing open problem of
constructing a unipotent element in black box groups of Lie type. </font></font></div><div><span style="font-family:"times new roman",serif;font-size:large">This is a joint work with Alexandre Borovik. </span></div></div>