Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1007/bfb006...
Part of book or chapter of book . 1979 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
versions View all 1 versions
addClaim

Lower bounds for the n-moduli of path families with applications to boundary behavior of quasiconformal and quasiregular mappings

Authors: Matti Vuorinen;

Lower bounds for the n-moduli of path families with applications to boundary behavior of quasiconformal and quasiregular mappings

Abstract

If El, E2, and G mR n then A(EI,E2;G) denotes the set of all closed paths joining E 1 and E_ in G (cf. [9, p. 21]). Let El, Bi(r) = : r E 2 cR n with 0 6 El' E2' let {x 6 R n Ixl 0, and let F r = A(EI,E2;R n ~ Bn(r)) for r > 0. In this note we shall study the problem of finding a lower bound for the n-modulus M(F r) of F r in terms of r and the densities of E 1 and E 2 at 0. One can derive estimates of this kind by means of the cap-inequality [9, 10.9] under the assumption that both E 1 and E 2 intersect ~Bn(r) for all r 6 (0,i]. Hence it is of interest to study the situation under weaker density conditions on E 1 and E 2. For this purpose we employ the lower capacity density cap dens (E,x) of a set E at x 6 R n (cf. Section 2 and Martio-Sarvas [6]). The main result of this note, which is given in Theorem 3.1, states (Ej = > 0 j : 1,2, then that if cap dens ,0) 63 ,

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Related to Research communities
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!