Abstract

In this article, we extend the classical framework for computing discriminants of special quasi-orthogonal polynomials from Schur’s resultant formula, and establish a framework for computing discriminants of a sufficiently broader class of polynomials from the resultant formulas that are proven by Ulas and Turaj. More precisely, we derive a formula for the discriminant of a sequence {rA,n+crA,n-1}\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\{r_{A,n}+c r_{A,n-1}\\}$$\\end{document} of polynomials. Here, c is an element of a field K and {rA,n}\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\{r_{A,n}\\}$$\\end{document} is a sequence of polynomials satisfying a certain recurrence relation. There are several works computing the discriminants of given polynomials. For example, Kaneko–Niiho and Mahlburg–Ono independently proved the formula for the discriminants of certain hypergeometric polynomials that are related to j-invariants of supersingular elliptic curves. Sawa–Uchida proved the formula for the discriminants of quasi-Jacobi polynomials and applied it to prove the nonexistence of certain rational quadrature formulas. Our main theorem presents a uniform way to prove a vast generalization of the above formulas for the discriminants.

Full Text
Paper version not known

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 call

Disclaimer: 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.