On the Number of Real Types of Univariate Polynomials
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915142186303488 |
|---|---|
| author | Faroß, Nicolas Sturm, Thomas |
| author_facet | Faroß, Nicolas Sturm, Thomas |
| contents | The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the special case of a single polynomial we present a closed-form expression involving Fibonacci numbers. This allows us to precisely describe the asymptotic growth of the number of real types as the degree increases, in terms of the golden ratio. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_04914 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Number of Real Types of Univariate Polynomials Faroß, Nicolas Sturm, Thomas Symbolic Computation The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the special case of a single polynomial we present a closed-form expression involving Fibonacci numbers. This allows us to precisely describe the asymptotic growth of the number of real types as the degree increases, in terms of the golden ratio. |
| title | On the Number of Real Types of Univariate Polynomials |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2502.04914 |