Related papers: Computation of Admissible Arakelov-Green Functions…
Arakelov-Green functions defined on metrized graphs have important role in relating arithmetical problems on algebraic curves into graph theoretical problems. In this paper, we clarify the combinatorial interpretation of certain…
We derive explicit formulas for the Arakelov-Green function and the Faltings delta-invariant of a Riemann surface. A numerical example illustrates how these formulas can be used to calculate Arakelov invariants of curves.
We determine the asymptotic behavior of the Arakelov metric, the Arakelov-Green's function, and the Faltings delta-invariant for arbitrary one-parameter families of complex curves with semistable degeneration. The leading terms in the…
Using an explicit version of the Mumford isomorphism on the moduli space of hyperelliptic curves we derive a closed formula for the Arakelov-Green function of a hyperelliptic Riemann surface evaluated at its Weierstrass points.
We give an alternative proof of the Faltings-Elkies bound on the average value of the Arakelov-Green function in pairs of a given set of $n$ points on a Riemann surface, which grows asymptotically like $O((\log n)/n)$. Our result is…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
In the graph-based semi-supervised learning, the Green-function method is a classical method that works by computing the Green's function in the graph space. However, when applied to large graphs, especially those sparse ones, this method…
We introduce functions associated to polarized dynamical systems that generalize averages of the dynamical Arakelov-Green's functions for rational functions due to Baker and Rumely. For a polarized dynamical system $X\to X$ over a product…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
The thermal Euclidean Green functions for Photons propagating in the Rindler wedge are computed employing an Euclidean approach within any covariant Feynman-like gauge. This is done by generalizing a formula which holds in the Minkowskian…
The purpose of this article is to initiate Arakelov theory in a noncommutative setting. More precisely, we are concerned with Arakelov theory of noncommutative arithmetic curves. Our first main result is an arithmetic Riemann-Roch formula…
This memoir is devoted to the study of formal-analytic arithmetic surfaces. These are arithmetic counterparts, in the context of Arakelov geometry, of germs of smooth complex-analytic surfaces along a projective complex curve.…
We introduce the p-adic analogue of Arakelov intersection theory on arithmetic surfaces. The intersection pairing in an extension of the p-adic height pairing for divisors of degree 0 in the form described by Coleman and Gross. It also uses…
Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. We propose the systematic use of symmetric spaces in representation learning,…
A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…
We consider the Faddeev-Green function in the three-dimensional space and in a slab, and we construct formal asymptotic expansions for the large complex parameter appearing in this function. The basic idea of the construction is to express…