The 3G inequality for a uniformly John domain (Q2574385): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.2996/kmj/1123767003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009878448 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2996/KMJ/1123767003 / rank
 
Normal rank

Latest revision as of 08:01, 19 December 2024

scientific article
Language Label Description Also known as
English
The 3G inequality for a uniformly John domain
scientific article

    Statements

    The 3G inequality for a uniformly John domain (English)
    0 references
    0 references
    0 references
    21 November 2005
    0 references
    The 3G inequality for a domain \(D\subset {\mathbb R}^d\) (\(d\geq 3\)) refers to the following inequality: \[ {{G(x,y)G(y,z)}\over{G(x,z)}}\leq A(| x-y| ^{2-d}+| y-z| ^{2-d})\quad \text{ for}\;\;x,y,z\in D \] where \(G\) is the Green function for \(D\) and \(A\) is a constant depending only on \(D\). This 3G inequality was first established for bounded Lipschitz domains by \textit{M. Cranston, E. Fabes} and \textit{Z. Zhao} [Trans. Am. Math. Soc. 307, 171--194 (1988; Zbl 0652.60076)]. Later the planar version (with suitably modified right hand side) for arbitrary domains was established by \textit{R. F. Bass} and \textit{K. Burdzy} [Probab. Theory Relat. Fields 101, 479--493 (1995; Zbl 0834.60089)]. In this paper the authors prove the 3G inequality for the so-called uniformly John domains (whose Martin boundary need not coincide with the Euclidean boundary). Also, the authors construct a domain such that the Martin boundary coincides with the Euclidean boundary and yet the 3G inequality fails to hold.
    0 references
    Green function
    0 references
    boundary Harnack principle
    0 references
    uniformly John domain
    0 references
    inner uniform domain
    0 references
    0 references

    Identifiers