Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
