1976
DOI: 10.32917/hmj/1206136452
|View full text |Cite
|
Sign up to set email alerts
|

Generalized extremal length of an infinite network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…(Extremal length was first investigated by Duffin [16] in the discrete setting, and extremal length of order p was studied in Nakamura and Yamasaki [30]. By simple calculation, we verify that our definition is equivalent to theirs.…”
Section: Lemma 23 ([19 Proposition 4])mentioning
confidence: 54%
See 1 more Smart Citation
“…(Extremal length was first investigated by Duffin [16] in the discrete setting, and extremal length of order p was studied in Nakamura and Yamasaki [30]. By simple calculation, we verify that our definition is equivalent to theirs.…”
Section: Lemma 23 ([19 Proposition 4])mentioning
confidence: 54%
“…where o is a fixed point of V (see [30]). Let us denote by L 1,p 0 (G, r) the closure of the set of functions with finite supports.…”
Section: §2 Infinite Network and The Royden Compactificationmentioning
confidence: 99%
“…Pick an a ∈ B 1 ∩ ∂D. By combining Theorem 2.1 and Theorem 2.4 of [4] we see that λ p (P a ) < ∞ if and only if cap p ({a}, ∞, D) > 0. Thus to finish the proof we need to show cap p ({a}, ∞, D) > 0, which we now proceed to do.…”
Section: Proof Of Theorem 32mentioning
confidence: 89%
“…[8] for an introduction and survey on this topic). It was in this cultural climate that Nakamura and Yamasaki introduced in [9] on an infinite graph G with node set V the mapping 1…”
Section: Introductionmentioning
confidence: 99%