相关论文: Computation of Admissible Arakelov-Green Functions…
We describe the computation of generalized Green functions and 2-parameter Green functions for finite reductive groups.
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…
We present numerical techniques based on generalized functions adapted to nonlinear calculations. They concern main numerical engineering problems ruled by-or issued from-nonlinear equations of continuum mechanics. The aim of this text is…
We initiate the study of enumerating linear subspaces of alternating matrices over finite fields with explicit coordinates. We postulate that this study can be viewed as a linear algebraic analogue of the classical topic of enumerating…
I introduce yet another way to associate a C*-algebra to a graph and construct a simple nuclear C*-algebra that has irreducible representations both on a separable and a nonseparable Hilbert space.
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
We introduce the regularized integrals for decorated graphs on elliptic curves, which produces an almost holomorphic function on upper half plane. Then we give the graph version of holomorphic anomaly equation to study the anti-holomorphic…
In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…
Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem when we are first…
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…
We explicitly calculate the Green functions describing quantum changes of topology in Friedman-Lemaitre-Robertson-Walker Universes whose spacelike sections are compact but endowed with distinct topologies. The calculations are performed…
Recent work on the quantization of Maxwell theory has used a non-covariant class of gauge-averaging functionals which include explicitly the effects of the extrinsic-curvature tensor of the boundary, or covariant gauges which, unlike the…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…
Green's functions are highly useful in analyzing the dynamical behavior of polynomials in their escaping set. The aim of this paper is to construct an analogue of Green's functions for planar quasiregular mappings of degree two and constant…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
The single-particle Green's function (GF) of mesoscopic structures plays a central role in mesoscopic quantum transport. The recursive GF technique is a standard tool to compute this quantity numerically, but it lacks physical transparency…