English

On higher-order discriminants

Classical Analysis and ODEs 2023-02-14 v1

Abstract

For the family of polynomials in one variable P:=xn+a1xn1++anP:=x^n+a_1x^{n-1}+\cdots +a_n, n4n\geq 4, we consider its higher-order discriminant sets {D~m=0}\{ \tilde{D}_m=0\}, where D~m:=\tilde{D}_m:=Res(P,P(m))(P,P^{(m)}), m=2m=2, \ldots, n2n-2, and their projections in the spaces of the variables ak:=(a1,,ak1,ak+1,,an)a^k:=(a_1,\ldots ,a_{k-1},a_{k+1},\ldots ,a_n). Set P(m):=j=0nmcjajxnmjP^{(m)}:=\sum _{j=0}^{n-m}c_ja_jx^{n-m-j}, Pm,k:=ckPxmP(m)P_{m,k}:=c_kP-x^mP^{(m)}. We show that Res(D~m,D~m/ak,ak)=Am,kBm,kCm,k2(\tilde{D}_m,\partial \tilde{D}_m/\partial a_k,a_k)= A_{m,k}B_{m,k}C_{m,k}^2, where Am,k=annmkA_{m,k}=a_n^{n-m-k}, Bm,k=B_{m,k}=Res(Pm,k,Pm,k)(P_{m,k},P_{m,k}') if 1knm1\leq k\leq n-m and Am,k=anmnkA_{m,k}=a_{n-m}^{n-k}, Bm,k=B_{m,k}=Res(P(m),P(m+1))(P^{(m)},P^{(m+1)}) if nm+1knn-m+1\leq k\leq n. The equation Cm,k=0C_{m,k}=0 defines the projection in the space of the variables aka^k of the closure of the set of values of (a1,,an)(a_1,\ldots ,a_n) for which PP and P(m)P^{(m)} have two distinct roots in common. The polynomials Bm,k,Cm,kC[ak]B_{m,k},C_{m,k}\in \mathbb{C}[a^k] are irreducible. The result is generalized to the case when P(m)P^{(m)} is replaced by a polynomial P:=j=0nmbjajxnmjP_*:=\sum _{j=0}^{n-m}b_ja_jx^{n-m-j}, 0bibj00\neq b_i\neq b_j\neq 0 for iji\neq j.

Keywords

Cite

@article{arxiv.1702.08216,
  title  = {On higher-order discriminants},
  author = {Vladimir Petrov Kostov},
  journal= {arXiv preprint arXiv:1702.08216},
  year   = {2023}
}
R2 v1 2026-06-22T18:29:13.934Z