The punishing factors for convex pairs are \(2^{n-1}\)
From MaRDI portal
Publication:925111
DOI10.4171/RMI/516zbMath1147.30014OpenAlexW2051250235MaRDI QIDQ925111
Karl-Joachim Wirths, Farit G. Avkhadiev
Publication date: 29 May 2008
Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.rmi/1204128303
convex functionsconvex domainbounded functionsclose-to-convex functionsTaylor coefficientsinverse functionslinear accessible domain
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp inequalities for the coefficients of concave schlicht functions
- Univalent functions. Selected topics
- Untersuchungen über schlichte Abbildungen
- Schwarz-Pick inequalities for hyperbolic domains in the extended plane
- On normal and automorphic functions
- Schwarz-Pick inequalities for derivatives of arbitrary order
- Punishing factors for angles
- Punishing factors and Chua's conjecture
- Sharp bounds for sums of coefficients of inverses of convex functions
- Some remarks on convex maps of the unit disk
- Subordinate families of analytic functions
- Hadamard products of schlicht functions and the Polya-Schoenberg conjecture
- On Close-To-Convex Functions and Linearly Accessible Domains
This page was built for publication: The punishing factors for convex pairs are \(2^{n-1}\)
