Abstract
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orbit are solved only once, allowing for a systematic filtration of redundant data. Computations with cddlib, Gfan, PHCpack, and Sage are illustrated on cyclic n-roots polynomial systems.
This material is based upon work supported by the National Science Foundation under Grant No. 0713018 and Grant No. 1115777.
Chapter PDF
Similar content being viewed by others
Keywords
References
Adrovic, D.: Solving Polynomial Systems with Tropical Methods. PhD thesis, University of Illinois at Chicago, Chicago (2012)
Adrovic, D., Verschelde, J.: Polyhedral methods for space curves exploiting symmetry. arXiv:1109.0241v1
Adrovic, D., Verschelde, J.: Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors to multivariate polynomials with approximate coefficients. Journal of Symbolic Computation 46(7), 755–772 (2011); Special Issue in Honour of Keith Geddes on his 60th Birthday, edited by Giesbrecht, M.W., Watt, S.M.
Adrovic, D., Verschelde, J.: Computing Puiseux series for algebraic surfaces. In: van der Hoeven, J., van Hoeij, M. (eds.) Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC 2012), pp. 20–27. ACM (2012)
Aroca, F., Ilardi, G., López de Medrano, L.: Puiseux power series solutions for systems of equations. International Journal of Mathematics 21(11), 1439–1459 (2011)
Backelin, J.: Square multiples n give infinitely many cyclic n-roots. Reports, Matematiska Institutionen 8, Stockholms universitet (1989)
Beringer, F., Richard-Jung, F.: Multi-variate polynomials and Newton-Puiseux expansions. In: Winkler, F., Langer, U. (eds.) SNSC 2001. LNCS, vol. 2630, pp. 240–254. Springer, Heidelberg (2003)
Bernshteǐn, D.N.: The number of roots of a system of equations. Functional Anal. Appl., 9(3):183–185 (1975); Translated from Funktsional. Anal. i Prilozhen 9(3), 1–4 (1975)
Björck, G., Fröberg, R.: Methods to “divide out” certain solutions from systems of algebraic equations, applied to find all cyclic 8-roots. In: Herman, I. (ed.) The Use of Projective Geometry in Computer Graphics. LNCS, vol. 564, pp. 57–70. Springer, Heidelberg (1992)
Björck, G., Haagerup, U.: All cyclic p-roots of index 3, found by symmetry-preserving calculations. Preprint available at http://www.math.ku.dk/~haagerup
Bogart, T., Jensen, A.N., Speyer, D., Sturmfels, B., Thomas, R.R.: Computing tropical varieties. Journal of Symbolic Computation 42(1), 54–73 (2007)
Bruno, A.D.: Power Geometry in Algebraic and Differential Equations. North-Holland Mathematical Library, vol. 57. Elsevier (2000)
Colin, A.: Solving a system of algebraic equations with symmetries. Journal of Pure and Applied Algebra 177-118, 195–215 (1997)
Dai, Y., Kim, S., Kojima, M.: Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods. J. Comput. Appl. Math. 152(1-2), 83–97 (2003)
De Loera, J.A., Rambau, J., Santos, F.: Triangulations. Structures for Algorithms and Applications. Algorithms and Computation in Mathematics, vol. 25. Springer (2010)
Emiris, I.Z.: Sparse Elimination and Applications in Kinematics. PhD thesis, University of California, Berkeley (1994)
Emiris, I.Z., Canny, J.F.: Efficient incremental algorithms for the sparse resultant and the mixed volume. Journal of Symbolic Computation 20(2), 117–149 (1995)
Faugère, J.C.: A new efficient algorithm for computing Gröbner bases (f 4). Journal of Pure and Applied Algebra 139(1-3), 61–88 (1999); Proceedings of MEGA 1998, Saint-Malo, France, June 22-27 (1998)
Faugère, J.C.: Finding all the solutions of Cyclic 9 using Gröbner basis techniques. In: Computer Mathematics - Proceedings of the Fifth Asian Symposium (ASCM 2001). Lecture Notes Series on Computing, vol. 9, pp. 1–12. World Scientific (2001)
Faugère, J.C., Rahmany, S.: Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. In: Johnson, J., Park, H. (eds.) Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009), pp. 151–158. ACM (2009)
Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 91–111. Springer, Heidelberg (1996)
Gao, T., Li, T.Y., Wu, M.: Algorithm 846: MixedVol: a software package for mixed-volume computation. ACM Trans. Math. Softw. 31(4), 555–560 (2005)
Gatermann, K.: Computer Algebra Methods for Equivariant Dynamical Systems. Lecture Notes in Mathematics, vol. 1728. Springer (2000)
Gel’fand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants and Multi-dimensional Determinants. Birkhäuser (1994)
Grigoriev, D., Weber, A.: Complexity of solving systems with few independent monomials and applications to mass-action kinetics. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2012. LNCS, vol. 7442, pp. 143–154. Springer, Heidelberg (2012)
Haagerup, U.: Cyclic p-roots of prime length p and related complex Hadamard matrices. Preprint available at http://www.math.ku.dk/~haagerup
Hampton, M., Moeckel, R.: Finiteness of relative equilibria of the four-body problem. Invent. math. 163, 289–312 (2006)
Herrero, M.I., Jeronimo, G., Sabia, J.: Affine solution sets of sparse polynomial systems. Journal of Symbolic Computation 51(1), 34–54 (2013); Dickenstein, A., Di Rocco, S., Hubert, E., Schicho, J. (eds.): Collected papers of MEGA 2011. Effective Methods in Algebraic Geometry, Stockholm, Sweden, May 30-June 3 (2011)
Hubert, E., Labahn, G.: Rational invariants of scalings from Hermite normal forms. In: van der Hoeven, J., van Hoeij, M. (eds.) Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC 2012), pp. 219–226. ACM (2012)
Jensen, A., Hampton, M.: Finiteness of spatial central configurations in the five-body problem. Celestial Mechanics and Dynamical Astronomy 109, 321–332 (2011)
Jensen, A.N.: Computing Gröbner fans and tropical varieties in Gfan. In: Stillman, M.E., Takayama, N., Verschelde, J. (eds.) Software for Algebraic Geometry. The IMA Volumes in Mathematics and its Applications, vol. 148, pp. 33–46. Springer (2008)
Jensen, A.N., Markwig, H., Markwig, T.: An algorithm for lifting points in a tropical variety. Collectanea Mathematica 59(2), 129–165 (2008)
Jeronimo, G., Matera, G., Solernó, P., Waissbein, A.: Deformation techniques for sparse systems. Foundations of Computational Mathematics 9(1), 1–50 (2009)
Ya, B.: Kazarnovskii. Truncation of systems of polynomial equations, ideals and varieties. Izvestiya: Mathematics 63(3), 535–547 (1999)
Lee, T.L., Li, T.Y., Tsai, C.H.: HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method. Computing 83(2-3), 109–133 (2008)
Leykin, A., Verschelde, J., Zhao, A.: Newton’s method with deflation for isolated singularities of polynomial systems. Theoret. Comput. Sci. 359(1-3), 111–122 (2006)
Maurer, J.: Puiseux expansion for space curves. Manuscripta Math. 32, 91–100 (1980)
McDonald, J.: Fractional power series solutions for systems of equations. Discrete Comput. Geom. 27(4), 501–529 (2002)
Payne, S.: Fibers of tropicalization. Mathematische Zeitschrift 262(2), 301–311 (2009)
Poteaux, A.: Calcul de développements de Puiseux et application au calcul du groupe de monodromie d’une courbe algébrique plane. PhD thesis, University of Limoges, Limoges (2008)
Poteaux, A., Rybowicz, M.: Good reduction of Puiseux series and complexity of the Newton-Puiseux algorithm over finite fields. In: Jeffrey, D. (ed.) Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation (ISSAC 2008), pp. 239–246. ACM (2008)
Poteaux, A., Rybowicz, M.: Good reduction of Puiseux series and applications. Journal of Symbolic Computation 47(1), 32–63 (2012)
Puiseux, V.: Recherches sur les fonctions algébriques. J. de Math. Pures et Appl. 15, 365–380 (1850)
Richter-Gebert, J., Sturmfels, B., Theobald, T.: First steps in tropical geometry. In: Litvinov, G.L., Maslov, V.P. (eds.) Idempotent Mathematics and Mathematical Physics. Contemporary Mathematics, vol. 377, pp. 289–317. AMS (2005)
Rond, G.: About the algebraic closure of the field of power series in several variables in characteristic zero. arXiv:1303.1921v2
Sabeti, R.: Numerical-symbolic exact irreducible decomposition of cyclic-12. LMS Journal of Computation and Mathematics 14, 155–172 (2011)
Servi, T.: Multivariable Newton-Puiseux theorem for convergent generalised power series. arXiv:1304.0108v3
Sommese, A.J., Verschelde, J., Wampler, C.W.: Homotopies for intersecting solution components of polynomial systems. SIAM J. Numer. Anal. 42(4), 552–1571 (2004)
Sommese, A.J., Verschelde, J., Wampler, C.W.: Introduction to numerical algebraic geometry. In: Dickenstein, A., Emiris, I.Z. (eds.) Solving Polynomial Equations. Foundations, Algorithms and Applications. Algorithms and Computation in Mathematics, vol. 14, pp. 301–337. Springer (2005)
Steidel, S.: Gröbner bases of symmetric ideals. Journal of Symbolic Computation 54(1), 72–86 (2013)
Stein, W.A., et al.: Sage Mathematics Software (Version 4.5.2). The Sage Development Team (2010), http://www.sagemath.org
Sturmfels, B.: On the Newton polytope of the resultant. Journal of Algebraic Combinatorics 3, 207–236 (1994)
Sturmfels, B.: Gröbner Bases and Convex Polytopes. University Lecture Series, vol. 8. AMS (1996)
Szöllősi, F.: Construction, classification and parametrization of complex Hadamard matrices. PhD thesis, Central European University, Budapest, arXiv:1110.5590v1 (2011)
Verschelde, J.: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2), 251–276 (1999) Software available at http://www.math.uic.edu/~jan/download.html
Verschelde, J.: Polyhedral methods in numerical algebraic geometry. In: Bates, D.J., Besana, G., Di Rocco, S., Wampler, C.W. (eds.) Interactions of Classical and Numerical Algebraic Geometry. Contemporary Mathematics, vol. 496, pp. 243–263. AMS (2009)
Verschelde, J., Gatermann, K.: Symmetric Newton polytopes for solving sparse polynomial systems. Adv. Appl. Math. 16(1), 95–127 (1995)
Walker, R.J.: Algebraic Curves. Princeton University Press (1950)
Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Adrovic, D., Verschelde, J. (2013). Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic n-roots Problem. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2013. Lecture Notes in Computer Science, vol 8136. Springer, Cham. https://doi.org/10.1007/978-3-319-02297-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-02297-0_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02296-3
Online ISBN: 978-3-319-02297-0
eBook Packages: Computer ScienceComputer Science (R0)