Pith. sign in

REVIEW 1 cited by

The Dirichlet problem for orthodiagonal maps

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.01613 v1 pith:5CQVUJOY submitted 2019-06-04 math.PR math.CV

classification math.PRmath.CV
keywords orthodiagonaldiscretemapsdirichletgraphsmeshplanarrandom
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as the mesh size goes to 0. This provides a convergence statement for discrete holomorphic functions, similar to the one obtained by Chelkak and Smirnov for isoradial graphs. We observe that by the double circle packing theorem, any finite, simple, 3-connected planar map admits an orthodiagonal representation. Our result improves the work of Skopenkov and Werness by dropping all regularity assumptions required in their work and providing effective bounds. In particular, no bound on the vertex degrees is required. Thus, the result can be applied to models of random planar maps that with high probability admit orthodiagonal representation with mesh size tending to 0. In a companion paper, we show that this can be done for the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random walk reflected off of infinity, with applications to uniform spanning forests and supercritical Liouville quantum gravity

    math.PR 2025-06 conditional novelty 9.0 of 10

    A random walk that reflects off the boundary at infinity yields new algorithmic constructions of the free uniform spanning forest and a conjectural embedding framework for supercritical Liouville quantum gravity.

Pith tools