Related papers: Explicit Computation of Certain Arakelov-Green Fun…
The classical Green's function associated to a simply connected domain in the complex plane is easily expressed in terms of a Riemann mapping function. The purpose of this paper is to express the Green's function of a finitely connected…
We interpret the "explicit formulas" in the sense of analytic number theory for the zeta function of an elliptic curve over a finite field as a transversal index theorem on a 3-dimensional laminated space.
We establish algebraicity criteria for formal germs of curves in algebraic varieties over number fields and apply them to derive a rationality criterion for formal germs of functions, which extends the classical rationality theorems of…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
Gauge invariant quark two-point Green's functions defined with path-ordered gluon field phase factors along skew-polygonal lines joining the quark to the antiquark are considered. Functional relations between Green's functions with…
Recently, a new method for calculating the Cherenkov field acting on a point-like electron bunch passing through longitudinally homogeneous structures lined with arbitrary slowdown layers was proposed, where the formalism was obtained…
An earlier contour expression for the Green function of a free complex scalar field in the presence of a conical singularity with localised magnetic flux is shown to yield expressions for the field correlator and defect block expansions…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
We compute the $L$-functions of a large class of algebraic curves, and verify the expected functional equation numerically. Our computations are based on our previous results on stable reduction to calculate the local $L$-factor and the…
The newly developed Gorkov-Green's function approach represents a promising path to the ab initio description of medium-mass open-shell nuclei. We discuss the implementation of the method at second order with a two-body interaction, with…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of…
We express connected Fermionic Green's functions in terms of completely explicit tree formulas. In contrast with the ordinary formulation in terms of Feynman graphs these formulas allow a completely transparent proof of convergence of the…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
An oscillation formula is established for the $k$-th eigenvector (assumed to be simple and with non-zero entries) of a weighted graph operator. The formula directly attributes the number of sign changes exceeding $k-1$ to the cycles in the…
An analytical Green's function is developed to study the acoustic scattering by a flat plate with a serrated edge. The scattered pressure is solved using the Wiener-Hopf technique in conjunction with the adjoint technique. It is shown that…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…
In this work, we present a mesh-independent, data-driven library, chebgreen, to mathematically model one-dimensional systems, possessing an associated control parameter, and whose governing partial differential equation is unknown. The…