Parameterization of the discriminant set of a polynomial. (English. Russian original) Zbl 1401.13080

Program. Comput. Softw. 42, No. 2, 65-76 (2016); translation from Programmirovanie 42, No. 2 (2016).
Summary: The discriminant set of a real polynomial is studied. It is shown that this set has a complex hierarchical structure and consists of algebraic varieties of various dimensions. A constructive algorithm for a polynomial parameterization of the discriminant set in the space of the coefficients of the polynomial is proposed. Each variety of a greater dimension can be geometrically considered as a tangent developable surface formed by one-dimensional linear varieties. The role of the directrix is played by the component of the discriminant set with the dimension by one less on which the original polynomial has a single multiple root and the other roots are simple. The relationship between the structure of the discriminant set and the partitioning of natural numbers is revealed. Various algorithms for the calculation of subdiscriminants of polynomials are also discussed. The basic algorithms described in this paper are implemented as a library for Maple.


13P15 Solving polynomial systems; resultants
14Q10 Computational aspects of algebraic surfaces
68W30 Symbolic computation and algebraic computation


desing; PGeomlib; Maple
Full Text: DOI


[1] Batkhin, A.B., Bruno A. D., and Varin V. P. Stability sets of multiparameter Hamiltonian systems, J. Appl. Math. Mech., 2012, vol. 76, no. 1. pp. 56-92. · Zbl 1272.70076
[2] Gryazina, E.N., Polyak, B.T., and Tremba, A.A., Ddecomposition technique state of-the-art, Autom. Remote Control, 2008, vol. 69, no. 12. pp. 1991-2026. · Zbl 1160.93003
[3] Markeev A. P., Tochki libratsii v nebesnoi mekhanike i kosmodinamike (Libration Points in Celestial Mechanics and Spaceflight Dynamics), Moscow: Nauka, 1978.
[4] Meiman, N.N., Some problems on the distributions of the zeroes of polynomials, Usp. Mat. Nauk, 1949, vol. 4, no. 6 (34), pp. 154-188.
[5] Batkhin, A.B., Structure of discriminant set of real polynomial, Chebyshevskii Sb., 2015, vol. 16, no. 2. pp. 23-34. http://mimathnetru/rus/cheb/v16/i2/p23. · Zbl 1441.13070
[6] Batkhin, A.B., Parametrization of the discriminant set of a real polynomial, Preprint of the Keldysh Institute of Applied Mathematics, Moscow, 2015, no. 76. http://keldyshru/papers/2015/prep2015_76pdf. · Zbl 1441.13070
[7] Batkhin, A. B.; Vassiliev, N. N. (ed.), On the structure of discriminant set of real polynomial, 9-12 (2015), St. Petersburg, Russia
[8] Sushkevich, A.K., Osnovy vysshei algebry (Foundation of Higher Algebra), Moscow: OGIZ GITTL, 1941, 4th. ed.
[9] Prasolov, V.V., Polynomials, Algorithms and Computations in Mathematics, vol. 10, Berlin: Springer, 2004.
[10] Basu, S., Pollack, R., and Roy, M.-F., Algorithms in Real Algebraic Geometry, Algorithms and Computations in Mathematics, vol. 10, Berlin: Springer, 2006. · Zbl 1102.14041
[11] Uteshev, A.Yu. and Cherkasov, T.M., The search for the maximum of a polynomial, J. Symbolic Comput., 1998, vol. 25, no. 5, pp. 587-618. · Zbl 0915.65062
[12] Lickteig, T. and Roy, M.-F., Sylvester-Habicht sequences and fast Cauchy index computation, J. Symbolic Comput., 2001, vol. 31, pp. 315-341. · Zbl 0976.65043
[13] Gathen, J. von zur and Lücking, T., Subresultants revisited, Theor. Comput. Sci., 2003, vol. 297, pp. 199-239. · Zbl 1045.68168
[14] Jury, E.I., Inners and Stability of Dynamic Systems, New York: Wiley, 1974. · Zbl 0307.93025
[15] Cayley, A., Note sur la méthode d’limination de Bezout, J. Reine Angew. Math., 1855, vol. 53, pp. 366-367.
[16] Gelfand I.M., Kapranov M.M., and Zelevinsky A.V., Discriminants, Resultants, and Multidimensional Determinants, Boston: Birkhäuser, 1994. · Zbl 0827.14036
[17] Diaz-Toca, G.M. and Gonzales-Vega, L., Various new expressions for subresultants and their applications, Appl. Algebra Eng., Comm. Comput., 2004, vol. 15, pp. 233-266. · Zbl 1073.15007
[18] Abdeljaoued, J., Diaz-Toca, G.M., and Gonzalez-Vega, L., Minors of Bézout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor, Int. J. Comput. Math., 2004, vol. 81, pp. 1223-1238. · Zbl 1063.65020
[19] Kalinina, E.A. and Uteshev, A.Yu., Teoriya isklyucheniya (Elimination Theory), St. Petersburg: Naucho-issledovatel’skii inst. khimii, St. Petersburg Univ., 2002.
[20] Sylvester, J. J., No article title, A method of determining by mere inspection the derivatives from two equations of any degree, 1, 54-57 (1973)
[21] Bôcher, M., Introduction to Higher Algebra, New York: Macmillan, 1907. · JFM 39.0118.01
[22] Krein, M.G. and Naimark, M.A., The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations, Linear Multilin. Algebra, 1981, vol. 10, no. 4. pp. 265-308. · Zbl 0584.12018
[23] Gantmacher F. R. Theory of Matrices. New York: Chelsea Publishing Co., 1959, Vols. 1 and 2. · Zbl 0085.01001
[24] Collins, G.E., Subresultants and reduced polynomial remainder sequences, J. ACM, 1967, vol. 14, no. 1. pp. 128-142. · Zbl 0152.35403
[25] Uteshev, A.Yu., Discriminant, 2015. http://pmpuru/ vf4/dets/discrim.
[26] Bruno A.D. and Batkhin A.B., Asymptotic solution of an algebraic equation, Dokl. Math., 2011, vol. 84, no. 2. pp. 634-639. · Zbl 1236.65049
[27] Bruno, A.D. and Batkhin, A.B., Resolution of an algebraic singularity by power geometry algorithms, Program. Comput. Software, 2012, vol. 38, no. 2. pp. 57-72. · Zbl 1253.13022
[28] Andrews, G.E., The Theory of Partitions, Reading: Addison-Wesley, 1976. · Zbl 0371.10001
[29] MacDonald, I.G., Symmetric Functions and Hall Polynomials, New York: Oxford Univ. Press, 1995. · Zbl 0824.05059
[30] Finikov, S.P., Theory of Surfaces, Moscow: KomKniga, 2010, 2nd ed.
[31] Krivoshapko, S.N. and Ivanov, V.N., Encyclopedia of Analytical Surfaces, Moscow: LIBROKOM, 2010. · Zbl 1321.53001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.