×

Detailed factorization identities for classical discriminant. (English) Zbl 07503898

Summary: A general polynomial in one variable is considered and the explicit factorization formulas for the truncations of the discriminant with respect to coordinate faces of the polynomial Newton polytope are presented. As a result, the extension of the formulas presented by Gelfand-Kapranov-Zelevinsky is obtained.

MSC:

14Mxx Special varieties
33Cxx Hypergeometric functions
14-XX Algebraic geometry
PDFBibTeX XMLCite
Full Text: DOI MNR

References:

[1] I.Gelfand, M.Kapranov, A.Zelevinsky, Discriminants, resultants and multidimensional determinants, Birkhäuser, Boston, 1994 · Zbl 0827.14036
[2] V.A.Vassiliev, Topology of complements to discriminants, M., 1997 (in Russian)
[3] I.A.Antipova, A.K.Tsikh, “The discriminant locus of a sistem of \(n\) Laurent polynomials in \(n\) variables”, Izv. Math., 76:5 (2012), 881-906 · Zbl 1254.32012 · doi:10.1070/IM2012v076n05ABEH002608
[4] E.N.Mikhalkin, V.A.Stepanenko, A.K.Tsikh, “Geometry of factorization identities for discriminants”, Dokl. Math., 102:1 (2020), 279-282 · Zbl 1477.14083 · doi:10.1134/S1064562420040134
[5] E.N.Mikhalkin, V.A.Stepanenko, A.K.Tsikh, “Blow-ups for the Horn-Kapranov parametrization of the classical discriminant”, Journ. of the European Math. Society (to appear) · Zbl 1478.32040
[6] M.Passare, A.Tsikh, “Algebraic equations and hypergeometric series”, The legacy of Niels Henrik Abel, Springer, Berlin-Heidelberg-New York, 2004, 653-672 · Zbl 1109.33017 · doi:10.1007/978-3-642-18908-1_21
[7] A.G.Kurosh, Kurs vysshey algebry, St.-Petersburg, 2020 (in Russian)
[8] V.V.Prasolov, Mnogochleny, M., 2014 (in Russian)
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.