The punishing factors for convex pairs are 2 n - 1 .

F. Avkhadiev; K.J. Wirths

Revista Matemática Iberoamericana (2007)

  • Volume: 23, Issue: 3, page 847-860
  • ISSN: 0213-2230

How to cite

top

Avkhadiev, F., and Wirths, K.J.. "The punishing factors for convex pairs are $2^{n-1}$.." Revista Matemática Iberoamericana 23.3 (2007): 847-860. <http://eudml.org/doc/43617>.

@article{Avkhadiev2007,
author = {Avkhadiev, F., Wirths, K.J.},
journal = {Revista Matemática Iberoamericana},
keywords = {convex domain; linear accessible domain; Taylor coefficients; convex functions; close-to-convex functions; inverse functions; bounded functions},
language = {eng},
number = {3},
pages = {847-860},
title = {The punishing factors for convex pairs are $2^\{n-1\}$.},
url = {http://eudml.org/doc/43617},
volume = {23},
year = {2007},
}

TY - JOUR
AU - Avkhadiev, F.
AU - Wirths, K.J.
TI - The punishing factors for convex pairs are $2^{n-1}$.
JO - Revista Matemática Iberoamericana
PY - 2007
VL - 23
IS - 3
SP - 847
EP - 860
LA - eng
KW - convex domain; linear accessible domain; Taylor coefficients; convex functions; close-to-convex functions; inverse functions; bounded functions
UR - http://eudml.org/doc/43617
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.