Descartes' rule of signs is exact! (Q619038): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jalgebra.2010.08.014 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jalgebra.2010.08.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020406245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inductive Proof of Descartes' Rule of Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descartes' Rule of Signs Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of roots of a lacunary bivariate polynomial on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative Pólya's theorem with zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descartes' Rule of Signs: Another Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Proof of Descartes's Rule of Signs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JALGEBRA.2010.08.014 / rank
 
Normal rank

Latest revision as of 22:31, 9 December 2024

scientific article
Language Label Description Also known as
English
Descartes' rule of signs is exact!
scientific article

    Statements

    Descartes' rule of signs is exact! (English)
    0 references
    21 January 2011
    0 references
    Descartes' rule of signs states that for any non-zero polynomial \(f\in\mathbb{R}[x]\) with \(t\) positive roots counted with multiplicities, the difference between the number of sign changes in the vector of coefficients of \(f\), denoted by \(S(f)\), and \(t\) is a non-negative even integer. Poincaré showed that this rule can be made exact, i.e., when the two quantities match up completely, by premultiplying \(f\) by a correction factor that depends on \(f\). The author first sharpens Poincaré's result and shows that the correction factor can be chosen as a polynomial with non-negative coefficients. As a second main result, the following general statement is proven: For any fixed \(f\in\mathbb{R}[x]\), the sequence \(S((x+1)^n f(x))\), \(n=0,1,\dots\) is monotone decreasing with limit equal to the number of positive roots of \(f\) counted with multiplicities. The paper is very well written and has a nice historical introduction to the topic.
    0 references
    0 references
    Descartes' rule of signs
    0 references
    root counting
    0 references
    0 references

    Identifiers