1968
DOI: 10.2140/pjm.1968.26.159
|View full text |Cite
|
Sign up to set email alerts
|

On a problem of Ilyeff

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
22
0

Year Published

1969
1969
2006
2006

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(23 citation statements)
references
References 1 publication
1
22
0
Order By: Relevance
“…It is not difficult to see that that max p∈S(n,1) |p| 1 = 1 (cf. [15]). On the other hand, Theorem 1 shows that max p∈S(n,0) |p| 0 increases to 1 as n → ∞.…”
Section: Propositionmentioning
confidence: 99%
“…It is not difficult to see that that max p∈S(n,1) |p| 1 = 1 (cf. [15]). On the other hand, Theorem 1 shows that max p∈S(n,0) |p| 0 increases to 1 as n → ∞.…”
Section: Propositionmentioning
confidence: 99%
“…The following corollary is obtained from Theorem 2 by taking r = k. The result (12) is due to Goodman, Rahman and Ratti [1] and (13) was proved by Rubinstein [4].…”
Section: / / All the Zeros Of A Polynomial P(z) Of Degree N Lie In \Zmentioning
confidence: 84%
“…(i) In the special case n = 4, & = 1, the above theorem gives an improvement on Theorem 2 of [5], since it guarantees the existence of a zero of…”
Section: N -K (N -K -L)(n -K)mentioning
confidence: 99%
“…Its validity for polynomials of degree <; 4 was proved in [1] and [5]. Rubinstein has shown in [5] that the statement holds in general if \z ά \ -1.…”
mentioning
confidence: 96%
See 1 more Smart Citation