A generalized Stieltjes system with polynomial source
Abstract
Let Q be a monic polynomial of degree M+1. We study the algebraic system \[ Σj i1xi-xj=Q(xi), i=1,…,N, \] for pairwise distinct complex numbers x1,…,xN, modulo permutations of these numbers. The case M=0 is, after a translation, the classical Stieltjes system for the zeros of a Hermite polynomial. We prove that, for arbitrary Q, the number of solutions is at most N+MN, and that the coefficient equations for the associated monic Stieltjes polynomial have total intersection multiplicity exactly N+MN. Consequently the bound is attained for all Q in a non-empty Zariski open subset of the affine space of monic polynomials of degree M+1. We also describe the solutions when the coefficient of the linear term of Q is large: the system splits into M+1 weakly coupled classical Stieltjes systems, one near each zero of Q.
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.