arXiv Analytics

Sign in

arXiv:1406.6331 [math.AP]AbstractReferencesReviewsResources

Dirichlet problems on graphs with ends

Tony Perkins

Published 2014-06-24Version 1

In classical potential theory, one can solve the Dirichlet problem on unbounded domains such as the upper half plane. These domains have two types of boundary points; the usual finite boundary points and another point at infinity. W. Woess has solved a discrete version of the Dirichlet problem on the ends of graphs analogous to having multiple points at infinity and no finite boundary. Whereas C. Kiselman has solved a similar version of the Dirichlet problem on graphs analogous to bounded domains. In this work, we combine the two ideas to solve a version of the Dirichlet problem on graphs with finitely many ends and boundary points of the Kiselman type.

Related articles: Most relevant | Search more
arXiv:1309.4204 [math.AP] (Published 2013-09-17)
$C^{1, 1}$ Solution of the Dirichlet Problem for Degenerate $k$-Hessian Equations
arXiv:1307.4999 [math.AP] (Published 2013-07-18)
Applications of Fourier analysis in homogenization of Dirichlet problem III: Polygonal Domains
arXiv:0904.3904 [math.AP] (Published 2009-04-24, updated 2009-04-30)
The $L^p$ Dirichlet Problem for the Stokes System on Lipschitz Domains