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

In this paper, we build on the work of [T. Hughes, G. Sangalli, VARIATIONAL MULTISCALE ANALYSIS: THE FINE-SCALE GREENS' FUNCTION, PROJECTION, OPTIMIZATION, LOCALIZATION, AND STABILIZED METHODS, SIAM Journal of Numerical Analysis, 45(2),…

The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

For a smooth function on a smooth manifold of a suitable class, the space of all connected components of preimages is the graph and called the {\it Reeb graph}. Reeb graphs are fundamental tools in the algebraic and differential topological…

We review some recent techniques for dealing with non-hermitian random matrix models based on generalized Green's functions. We introduce the diagrammatic methods in the hermitian case and generalize them to the non-hermitian case. The…

We consider the problem of graph generation guided by network statistics, i.e., the generation of graphs which have given values of various numerical measures that characterize networks, such as the clustering coefficient and the number of…

We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…

We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…

In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…

As a pioneering work we construct explicit real algebraic functions which may have both compact and non-compact preimages. The author has obtained explicit real algebraic functions with preimages satisfying some nice conditions. More…

We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several…

Motivated by the question of defining a $p$-adic string worldsheet action in genus one, we define a Laplacian operator on the Tate curve, and study its Green's function. We show that the Green's function exists. We provide an explicit…

The Reeb space of a smooth function is a topological and combinatoric object and fundamental and important in understanding topological and geometric properties of the manifold of the domain. It is the graph and a topological space endowed…

A graph profile records all possible densities of a fixed finite set of graphs. Profiles can be extremely complicated; for instance the full profile of any triple of connected graphs is not known, and little is known about hypergraph…

We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…

In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes $k$-colorable graphs.

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…