The punishing factors for convex pairs are 2ⁿ-1
DOI10.4171/RMI/516zbMATH Open1147.30014OpenAlexW2051250235MaRDI QIDQ925111FDOQ925111
Authors: Karl-Joachim Wirths, F. 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
Recommendations
convex functionsclose-to-convex functionsTaylor coefficientsbounded functionsconvex domaininverse functionslinear accessible domain
Special classes of univalent and multivalent functions of one complex variable (starlike, convex, bounded rotation, etc.) (30C45) Coefficient problems for univalent and multivalent functions of one complex variable (30C50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Schwarz-Pick inequalities for derivatives of arbitrary order
- Title not available (Why is that?)
- Untersuchungen über schlichte Abbildungen
- Hadamard products of schlicht functions and the Polya-Schoenberg conjecture
- Some remarks on convex maps of the unit disk
- Univalent functions. Selected topics
- On normal and automorphic functions
- Sharp inequalities for the coefficients of concave schlicht functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Close-To-Convex Functions and Linearly Accessible Domains
- Schwarz-Pick inequalities for hyperbolic domains in the extended plane
- Title not available (Why is that?)
- Punishing factors for angles
- Punishing factors and Chua's conjecture
- Sharp bounds for sums of coefficients of inverses of convex functions
- Subordinate families of analytic functions
Cited In (1)
This page was built for publication: The punishing factors for convex pairs are \(2^{n-1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925111)
