On higher-order discriminants

Abstract

For the family of polynomials in one variable P:=xn+a1xn-1+·s +an, n≥ 4, we consider its higher-order discriminant sets \ Dm=0\, where Dm:=Res(P,P(m)), m=2, …, n-2, and their projections in the spaces of the variables ak:=(a1,… ,ak-1,ak+1,… ,an). Set P(m):=Σ j=0n-mcjajxn-m-j, Pm,k:=ckP-xmP(m). We show that Res(Dm,∂ Dm/∂ ak,ak)= Am,kBm,kCm,k2, where Am,k=ann-m-k, Bm,k=Res(Pm,k,Pm,k') if 1≤ k≤ n-m and Am,k=an-mn-k, Bm,k=Res(P(m),P(m+1)) if n-m+1≤ k≤ n. The equation Cm,k=0 defines the projection in the space of the variables ak of the closure of the set of values of (a1,… ,an) for which P and P(m) have two distinct roots in common. The polynomials Bm,k,Cm,k∈ C[ak] are irreducible. The result is generalized to the case when P(m) is replaced by a polynomial P*:=Σ j=0n-mbjajxn-m-j, 0≠ bi≠ bj≠ 0 for i≠ j.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…