Related papers: Riemann-Hurwitz theorem and second main theorem fo…
We propose a new notion called \emph{infinity-harmonic maps}between Riemannain manifolds. These are natural generalizations of the well known notion of infinity harmonic functions and are also the limiting case of $p$% -harmonic maps as…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs…
By studying cohomology classes that are related with $n$-harmonic morphisms and $F$-harmonic maps, we augment and extend several results on $F$-harmonic maps, harmonic maps in [1, 3, 14], $p$-harmonic morphisms in [17], and also revisit our…
We showed in part I (hep-th/9912092) that the Hopf algebra ${\cal H}$ of Feynman graphs in a given QFT is the algebra of coordinates on a complex infinite dimensional Lie group $G$ and that the renormalized theory is obtained from the…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…
We observe, utilize dualities in differential equations and differential inequalities, dualities between comparison theorems in differential equations, and obtain dualities in "swapping" comparison theorems in differential equations. These…
These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian…
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…
In this paper, we construct the fundamental theorem of UP-homomorphisms in UP-algebras. We also give an application of the theorem to the first, second, third and fourth UP-isomorphism theorems in UP-algebras.
In this paper, we prove some difference analogue of second main theorems of meromorphic mapping from Cm into an algebraic variety V intersecting a finite set of fixed hypersurfaces in subgeneral position. As an application, we prove a…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…