1. Applications of Polyhedral Homotopy Continuation Methods to Topology. Takayuki Gunji (Tokyo Inst. of Tech.)

2. Contents  Polyhedral Homotopy Continuation Methods  Numerical examples  Applications to Topology

3. Introduction Polynomial systems come from various fields in science and engineering Inverse kinematics of robot manipulators. Equilibrium states. Geometric intersection problems. Formula construction. Find all isolated solutions of polynomial systems.

4. Introduction  Grobner Basis Using Mathematica It takes long time  Linear Homotopy  Polyhedral Homotopy PHCpack by J.Verschelde(1999) PHoM by Gunji at al.(2002)  Parallel Implementation

5. Isolated solutions. are isolated solutions 4 y x 3 2 1 O1234

6. Isolated solutions. aren’t isolated solutions 4 y x 3 2 1 O1234

7. The number of solutions. Cyclic_n problem. NNum.NNum 1034,94012367,488 11184,756132,704,156

8. Homotopy continuation method. The original system Step 2 Solving Step 1 Constructing homotopy systems such that and that can be solved easily

9. Homotopy continuation method. Step 3 Tracing homotopy paths. Solutions of the original system Solutions of

10. Linear homotopy Can be solved easily!

11. Polyhedral homotopy Binomial systemCan be solved by Euclidean algorithm. Same as

12. General position Example are solutions of this system.

13. General position Example When are randomly chosen, this case doesn’t happen with probability 1 (the measure of this case happening is 0) If, this system doesn’t have a continuous solution

14. General position Step 2: Find solutions of P(x)=0 by using this system Step 1 : P’(x)=0 solves by using polyhedral homotopy

15. Polyhedral Homotopy  D.N.Bernshtein “The number of roots of a system of equations”, Functional Analysis and Appl. 9 (1975)  B.Huber and B.Sturmfels “A Polyhedral method for solving sparse polynomial systems”, Mathematics of Computation 64 (1995)  T.Y.Li “Solving polynomial systems by polyhedral homotopies”, Taiwan Journal of Mathematics 3 (1999)

16. Polynomial system Constructing homotopy systems Solving binomial systems Tracing homotopy paths Verifying solutions All isolated solutions

17. Constructing homotopy systems The original system Randomly chosen multiply to each terms

18. Constructing homotopy systems

19. Divided by

20. Constructing homotopy systems Ex Find all satisfying the property that. Each equation, exactly 2 of power of t are 0.

21. Constructing homotopy systems Find all satisfying the property that. Each equation, exactly 2 of power of t are 0.

22. Constructing homotopy systems All of solutions.

23. Tracing homotopy path Using Predictor Corrector Method Predictor step Corrector step Corrector step : Newton Method Predictor step : tangent of path (increase of t)

24. Tracing homotopy path Taylor series Corrector step Predictor step

25. Polynomial system Constructing homotopy systems Solving binomial systems Tracing homotopy paths Verifying solutions All isolated solutions

26. Parallel Computing Path 1 Path 2 Path 4 Path 3Path 5 Independent!

27. Parallel Computing  Client and server model. Client Server 1 Server 2 Server 3 Server 4 Master problem sub problem

28. PHoM (Polyhedral Homotopy Continuation Methods) Single CPU version OS : Linux (gcc) http://www.is.titech.ac.jp/~kojima/PHoM/

29. Numerical examples Isolated solutions Linear Homotopy : the number of tracing path is 4. Polyhedral Homotopy : the number of tracing path is 2.

30. Numerical examples Cyclic_n problem.

31. Numerical examples problemNum.Time cyc_1034,9405mins cyc_11184,75630mins cyc_12367,4884hours cyc_132,704,15615hours The number of solutions Athlon 1200MHz 1GB(or2GB)x32CPU

32. Some applications to Topology  Representation space of a fundamental group in SL(2,C).  Computation of Reidemeister torsion  Joint works with Teruaki Kitano.

33. Representation into SL(2,C)  M: closed oriented 3-dimensional manifold  its fundamental group of M  an irreducible representation of  the set of conjugacy classes of SL(2,C)- irreducible representations.  is an algebraic variety over C  Problem: Determine in

34. Figure-eight knot case  Fundamental group of an exterior of figure- eight knot  2 generators and 1 relation  meridian u and longitude l.

35. Irreducible representation  Consider an irreducible representation into SL(2,C)  Write images as follows

36. Corresponding matrices  We consider conjugacy classes, then we may put U and V as follows

37. Representation space  From the relation wu=vw in the group, we obtain the following polynomial.

38. Dehn surgery along a knot  Put a relation in the fundamental group.  L is a corresponding matrix of a longitude l. The above relation gives one another polynomial g(x,y)=0 as a defining equation.

39. Apply the Homotopy Continuation Methods  This system of polynomial equations f=g=0 describe conjugacy classes of representations, that is, each solution is a corresponding one conjugacy class of representations.  We solve some case by using the polyhedral homotopy continuation methods.

40. Reidemeister torsion  Reidemeister torsion is a topological invariant of 3-manifolds with a representation parameterized by x and y.

41. Example 1 : (p,q)=(1,1)

42. Re(x)Im(x)Re(y)Im(y)R-torsion 0.5549503.246900.615894 -0.8019301.554901.28627 2.246900.19806010.1011

43. Example 2 : (p,q)=(1,2)

44. Re(x)Im(x)Re(y)Im(y)R-torsion -2.13472-0.020960.2768270.5871522.98851+0.563057i -2.134720.0209640.276827-0.587152.98851-0.563057i 0.95338601.7403600.0250711 0.3126703.5026602.86831 -0.8472202.6907801.20196 2.2386900.102616042.1263 -0.3880901.4099303.80094