The Computation of Braid Orbits
主 题: The Computation of Braid Orbits
The Inverse Galois Problem concerns whether or not every finite group $G$ can be realized as a Galois group over the rational numbers. Some special cases have been established, but the general case still remains open. One approach to the realization of a group as Galois group is via classification of complex curves admitting $G$, which is related to the problem of computing the orbits of braid group action on the generating tuples of $G$. Sometimes, when we have little information concerning certain phenomenon, a computer experiment can be very useful, and it may lead to both combinatorial and group theoretic approaches. In this talk, we will discuss the algorithmic aspects of computing these braid orbits.
报告人: Dr. Gehao Wang (BICMR)
时 间: 2014-09-23 13:45-14:45
地 点: Room 77201 at #78 courtyard, Beijing International Center for Mathematical Research （博士后讨论班活动）