🧭 New here?
Take a guided tour of the site.
← Back to Papers

Radii of univalence, starlikeness, and convexity

Shinji Yamashita · 1982 📄 DOI →

Continue from this paper

Indexing is not verification. Extracted statements should be checked against the source.

Read the original paper ↗ Search this title Learn what Atlas can verify → Suggest a correction or ask a question →

Results & Lemmas (2)

Each result is auto-extracted from the paper via OCR - the math is shown verbatim and may carry occasional transcription artifacts. Click to expand the full statement.

Theorem 1 Theorem 1. The identities u(B) = s B) and U[G(K)) = S[G(K)) hold. Next we investigate the lower bounds of c B) and c[p K)).
Theorem 1. The identities u(B) = s{B) and U[G(K)) = S[G(K)) hold. Next we investigate the lower bounds of c{B) and c[p{K)) .
Theorem 2 · radius Theorem 2. Let r = 0.090... be the root in (0, l) of the equation 2(l-r) - [l+kr+r ) = 0, and let r be the root in (0, l) of the equation…
Theorem 2. Let r = 0.090 ... be the root in (0, l) of the equation 2(l-r) - [l+kr+r ) = 0 , and let r be the root in (0, l) of the equation [l+K~ j(l-r) - (l+r) = 0 . Then o{B) > r and o[G(K)) > r3 . We note that (2-V3)r = 0.0k ... < r and (2-V/ §')r < r . The latter inequality needs a

Related Papers

Area and length maxima for univalent functions
1990
ON SOME FAMILIES OF ANALYTIC FUNCTIONS
1968
↑↓ navigate↵ openesc closeall results
✦ 291 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback