Related papers: Explicit Computation of Certain Arakelov-Green Fun…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
We obtain Poisson equations satisfied by elliptic modular graph functions with four links. Analysis of these equations leads to a non--trivial algebraic relation between the various graphs.
In our previous paper, Green functions associated to complex reflection groups G(e,1,n) were discussed. It involved a combinatorial approach to the Green functions of classical groups of type B_n or C_n. In this paper, we introduce Green…
The aim of this work is to outline in some detail the use of combinatorial algebra in planar quantum field theory. Particular emphasis is given to the relations between the different types of planar Green's functions. The key object is a…
A method to calculate exact Green's functions on lattices in various dimensions is presented. Expressions in terms of generalized hypergeometric functions in one or more variables are obtained for various examples by relating the resolvent…
The graph of a Hecke operator encodes all information about the action of this operator on automorphic forms. Let $X$ be a curve over $\mathbb{F}_q$, $F$ its function field and $\mathbb{A}$ the adele ring of $F$. In this paper we will…
In a recent series of scanning probe experiments, it became possible to visualize local electron flow in a two-dimensional electron gas. In this paper, a Green's function technique is presented that enables efficient calculation of the…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
Classical hypergeometric functions are well-known to play an important role in arithmetic algebraic geometry. These functions offer solutions to ordinary differential equations, and special cases of such solutions are periods of…
We study pluricomplex Green functions on algebraic sets. Let $f$ be a proper holomorphic mapping between two algebraic sets. Given a compact set $K$ in the range of $f$, we show how to estimate the pluricomplex Green functions of $K$ and of…
We show how to use the lattice Green function to calculate capacitances in two dimensions with boundary conditions at infinity. It is shown how to calculate coefficients of capacitance and induction from the lattice Green function. A…
In this paper, new representations of the Green's function for an acoustic d-dimensional half-space problem with impedance boundary conditions are presented. The main features of the new representation are: a) in addition to additive terms…
The sizes of Markov equivalence classes of directed acyclic graphs play important roles in measuring the uncertainty and complexity in causal learning. A Markov equivalence class can be represented by an essential graph and its undirected…
We revise critically existing approaches to evaluation of thermodynamic potentials within the Green's function calculations at finite electronic temperatures. We focus on the entropy and show that usual technical problems related to the…
We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet,…
In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs.
We present the Composite Operator Method (COM) as a modern approach to the study of strongly correlated electronic systems, based on the equation of motion and Green's function method. COM uses propagators of composite operators as building…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
We develop the theory of Abelian functions associated with algebraic curves. The growth in computer power and an advancement of efficient symbolic computation techniques has allowed for recent progress in this area. In this paper we focus…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…