Computation of the Resonance Set of a Polynomial under Constraints on Its Coefficients

Аннотация

Methods for computing the generalized discriminant set of a polynomial the roots of which satisfy a linear relation are considered. Using a q-analog of the classical elimination theory and computer algebra algorithms, methods for computing the parametric representation of this set are described, and these methods are implemented in a Maple library. The operation of these methods is demonstrated by an example.