Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1110.6737

The boundary value problem for discrete analytic functions

Mikhail Skopenkov
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is on further development of discrete complex analysis introduced by R. Isaacs, J. Ferrand, R. Duffin, and C. Mercat. We consider a graph lying in the complex plane and having quadrilateral faces. A function on the vertices is called discrete analytic, if for each face the difference quotients along the two diagonals are equal. We prove that the Dirichlet boundary value problem for the real part of a discrete analytic function has a unique solution. In the case when each face has orthogonal diagonals we prove that this solution uniformly converges to a harmonic function in the scaling limit. This solves a problem of S. Smirnov from 2010. This was proved earlier by R. Courant-K. Friedrichs-H. Lewy and L. Lusternik for square lattices, by D. Chelkak-S. Smirnov and implicitly by P.G. Ciarlet-P.-A. Raviart for rhombic lattices. In particular, our result implies uniform convergence of the finite element method on Delaunay triangulations. This solves a problem of A. Bobenko from 2011. The methodology is based on energy estimates inspired by alternating-current network theory.

Explore related subjects

math.COcs.NAmath.CVmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikhail Skopenkov. 2013-03-29. The boundary value problem for discrete analytic functions. https://doi.org/10.1016/j.aim.2013.03.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗