相关论文: Computation of Admissible Arakelov-Green Functions…

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…

The Reeb graph of a smooth function is a graph being a natural quotient space of the manifold of the domain and the space of all connected components of preimages. Such a combinatorial and topological object roughly and compactly represents…

This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

We provide Green's function estimates for parabolic operators on polyhedrons and polyhedral cones in $\mathbb{R}^3$. These estimates incorporate mixed weights, which include appropriate powers of the distances to the vertices, the edges,…

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…

In this paper, we focus on the sinh-Gordon equation on graphs. We introduce a uniform a priori estimate to define the topological degree for this equation with nonzero prescribed functions on finite, connected and symmetric graphs.…

We have been interested in graphs and realizing them as Reeb graphs of explicit real algebraic functions. The Reeb graph of a differentiable function is the quotient space of the manifold of the domain, regarded as the space consisting of…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

In a previous work [Andrade \textit{et al.}, Phys. Rep. \textbf{647}, 1 (2016)], it was shown that the exact Green's function (GF) for an arbitrarily large (although finite) quantum graph is given as a sum over scattering paths, where local…

We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and…

Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…

We present the class of semi-admissible subsets of an open Riemann surface on which Carleman approximation by non-critical holomorphic functions is possible. In particular we characterize closed sets with empty interior on which continuous…

A linear algebraic method named the shifted conjugate-orthogonal-conjugate-gradient method is introduced for large-scale electronic structure calculation. The method gives an iterative solver algorithm of the Green's function and the…

The Reeb graph of a function on a smooth manifold is the graph obtained as the space of all connected components of level sets such that the set of all vertices coincides with the set of all connected components of level sets including…

In this paper, we give a more direct proof of the results by Clair and Mokhtari-Sharghi on the zeta functions of periodic graphs. In particular, using appropriate operator-algebraic techniques, we establish a determinant formula in this…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Lusztig's algorithm of computing generalized Green functions of reductive groups involves an ambiguity of certain scalars. In this paper, for reductive groups of classical type with arbitrary characteristic, we determine those scalars…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

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…