Related papers: Polyharmonic functions for finite graphs and Marko…
The Perron method for solving the Dirichlet problem for $p$-harmonic functions is extended to unbounded open sets in the setting of a complete metric space with a doubling measure supporting a $p$-Poincar\'e inequality, $1<p<\infty$. The…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We study biharmonic maps between Riemannian manifolds with finite energy and finite bi-energy. We show that if the domain is complete and the target of non-positive curvature, then such a map is harmonic. We then give applications to…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…
We investigate the existence and multiplicity of solutions for a class of generalized coupled system involving poly-Laplacian and a parameter $\lambda$ on finite graphs. By using mountain pass lemma together with cut-off technique, we…
This paper studies the $p$-biharmonic equation on graphs, which arises in point cloud processing and can be interpreted as a natural extension of the graph $p$-Laplacian from the perspective of hypergraph. The asymptotic behavior of the…
We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…
We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…
The aim of this note is to show that lamplighter graphs where the space graph is infinite and at most two-ended and the lamp graph is at most two-ended do not admit harmonic functions with gradients in $\ell^p$ (\ie finite $p$-energy) for…
In this work we study the variational problem associated to dimer models, a class of models from integrable probability and statistical mechanics in dimension two which have been the focus of intense research efforts over the last decades.…
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We investigate the problem of the realization of a given graph as the Reeb graph $\mathcal{R}(f)$ of a smooth function $f\colon M\rightarrow \mathbb{R}$ with finitely many critical points, where $M$ is a closed manifold. We show that for…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based…
For any $N\ts N$ monodromy matrix we define the Lyapunov function, which is analytic on an associated N-sheeted Riemann surface. On each sheet the Lyapunov function has the standard properties of the Lyapunov function for the Hill operator.…
For a continuous function, we prove that the function is pluriharmonic if and only if the equality part of the optimal Ohsawa--Takegoshi $L^2$-extension theorem is satisfied with respect to the metric having the function as a weight. This…