Optimal factorization of Muckenhoupt weights

  • Peter Jones' theorem on the factorization of Ap weights is sharpened for weights with bounds near 1, allowing the factorization to be performed continuously near the limiting, unweighted case. When 1 < p < infinite and omega is an Ap weight with bound Ap(omega) = 1 + epsilon, it is shown that there exist Asub1 weights u, v such that both the formula omega = uv(1-p) and the estimates A1 (u), A1 (v) = 1 + Omikron (√epsilon) hold. The square root in these estimates is also proven to be the correct asymptotic power as epsilon -> 0.

Download full text files

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Michael Brian Korkey
URN:urn:nbn:de:kobv:517-opus-25266
Publication series (Volume number):Preprint ((1998) 15)
Publication type:Preprint
Language:English
Publication year:1998
Publishing institution:Universität Potsdam
Release date:2008/10/30
RVK - Regensburg classification:SI 990
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik
DDC classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Collection(s):Universität Potsdam / Schriftenreihen / Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partielle Differentialgleichungen und Komplexe Analysis
Universität Potsdam / Schriftenreihen / Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partielle Differentialgleichungen und Komplexe Analysis / 1998
License (German):License LogoKeine öffentliche Lizenz: Unter Urheberrechtsschutz
External remark:
Die Printversion kann in der Universitätsbibliothek Potsdam eingesehen werden:
Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partielle Differentialgleichungen und Komplexe Analysis, 1997-

Die Online-Fassung wird auf der Homepage des Instituts für Mathematik veröffentlicht.

Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.