Papers
Topics
Authors
Recent
Search
2000 character limit reached

On higher-order discriminants

Published 27 Feb 2017 in math.CA | (1702.08216v1)

Abstract: For the family of polynomials in one variable $P:=xn+a_1x{n-1}+\cdots +a_n$, $n\geq 4$, we consider its higher-order discriminant sets ${ \tilde{D}m=0}$, where $\tilde{D}_m:=$Res$(P,P{(m)})$, $m=2$, $\ldots$, $n-2$, and their projections in the spaces of the variables $ak:=(a_1,\ldots ,a{k-1},a_{k+1},\ldots ,a_n)$. Set $P{(m)}:=\sum {j=0}{n-m}c_ja_jx{n-m-j}$, $P{m,k}:=c_kP-xmP{(m)}$. We show that Res$(\tilde{D}m,\partial \tilde{D}_m/\partial a_k,a_k)= A{m,k}B_{m,k}C_{m,k}2$, where $A_{m,k}=a_n{n-m-k}$, $B_{m,k}=$Res$(P_{m,k},P_{m,k}')$ if $1\leq k\leq n-m$ and $A_{m,k}=a_{n-m}{n-k}$, $B_{m,k}=$Res$(P{(m)},P{(m+1)})$ if $n-m+1\leq k\leq n$. The equation $C_{m,k}=0$ defines the projection in the space of the variables $ak$ of the closure of the set of values of $(a_1,\ldots ,a_n)$ for which $P$ and $P{(m)}$ have two distinct roots in common. The polynomials $B_{m,k},C_{m,k}\in \mathbb{C}[ak]$ are irreducible. The result is generalized to the case when $P{(m)}$ is replaced by a polynomial $P_*:=\sum _{j=0}{n-m}b_ja_jx{n-m-j}$, $0\neq b_i\neq b_j\neq 0$ for $i\neq j$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.