| | |
| | |
Stat |
Members: 3665 Articles: 2'599'751 Articles rated: 2609
23 January 2025 |
|
| | | |
|
Article overview
| |
|
Parametric "Non-nested" Discriminants for Multiplicities of Univariate Polynomials | Hoon Hong
; Jing Yang
; | Date: |
1 Jan 2023 | Abstract: | We consider the problem of complex root classification, i.e., finding the
conditions on the coefficients of a univariate polynomial for all possible
multiplicity structures on its complex roots. It is well known that such
conditions can be written as conjunctions of several polynomial equations and
one inequation in the coefficients. Those polynomials in the coefficients are
called discriminants for multiplicities. It is well known that discriminants
can be obtained by using repeated parametric gcd’s. The resulting discriminants
are usually nested determinants, that is, determinants of matrices whose
entries are determinants, and so son. In this paper, we give a new type of
discriminants which are not based on repeated gcd’s. The new discriminants are
simpler in that they are non-nested determinants and have smaller maximum
degrees. | Source: | arXiv, 2301.00315 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|