1972
DOI: 10.1090/s0002-9939-1972-0288338-5
|View full text |Cite
|
Sign up to set email alerts
|

Pólya’s property 𝑊 and factorization—A short proof

Abstract: For an n n th order linear differential expression, the equivalence of Pólya’s Property W {\text {W}} and factorization into first order expressions is proven directly and briefly.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
5
0

Year Published

1973
1973
2013
2013

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 2 publications
0
5
0
Order By: Relevance
“…However, one encounters the problem of writing the inverse L −1 as an integro-differential operator. In the scalar case, L may be put in the form L = q n Dq n−1 D · · · q 1 Dq 0 , where the coefficients q i are expressible as quotients of wronskians of independent solutions v i of L(v) = 0 (see [31] for a simple derivation of this classical result, equivalent to decomposability into first-order factors; see [44] for the matrix case). In our context, q i are nonlocal functions and finding them is considered to be the most difficult part of the whole procedure.…”
Section: Introductionmentioning
confidence: 99%
“…However, one encounters the problem of writing the inverse L −1 as an integro-differential operator. In the scalar case, L may be put in the form L = q n Dq n−1 D · · · q 1 Dq 0 , where the coefficients q i are expressible as quotients of wronskians of independent solutions v i of L(v) = 0 (see [31] for a simple derivation of this classical result, equivalent to decomposability into first-order factors; see [44] for the matrix case). In our context, q i are nonlocal functions and finding them is considered to be the most difficult part of the whole procedure.…”
Section: Introductionmentioning
confidence: 99%
“…where Wx=yy and vVk=detiJ=1,... ,k[//~v] for k = 2,-■ ■ ,n-l. For a short and elegant proof of this factorization see [13]. A factorization of type (1.2) on an interval (a, b) is known to be equivalent to disconjugacy on (a, b).…”
Section: Introductionmentioning
confidence: 99%
“…, m + n) for u ∈ R + , such a factorization of T can always be achieved by wellknown techniques described for example in Eqn. (18) of [15]; see also [17] and [23]. Using this factorization, we can break down G in a way similar to (3.3) except that the A σi must be replaced by more complicated operators based on A and s i , similarly the B ρj by suitable operators involving B and r j .…”
mentioning
confidence: 99%