Related papers: Riemann-Hurwitz theorem and second main theorem fo…
We prove a simultaneous generalization of the classical Riemann-Hurwitz and Plucker formulas, addressing the total inflection of a morphism from a (smooth, projective) curve to an arbitrary (smooth, projective) higher-dimensional variety.…
By means of $C^\infty$-connections we will prove a general second main theorem and some special ones for holomorphic curves. The method gives a geometric proof of H. Cartan's second main theorem in 1933. By applying the same method, we will…
The possibility of reversion of the inequality in the Second Main Theorem of Cartan in the theory of holomorphic curves in projective space is discussed. A new version of this theorem is proved that becomes an asymptotic equality for a…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
By using tensor analysis, we find a connection between normed algebras and the parallelizability of the spheres S$^1$, S$^3$ and S$^7.$ In this process, we discovered the analogue of Hurwitz theorem for curved spaces and a geometrical…
We introduce and characterize central probability distributions on Littelmann paths. Next we establish a law of large numbers and a central limit theorem for the generalized Pitmann transform. We then study harmonic functions on…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
In this paper we prove a compactness theorem for a sequence of harmonic maps which are defined on a converging sequence of Riemannian manifolds.
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
Double Hurwitz numbers have at least four equivalent definitions. Most naturally, they count covers of the Riemann sphere by genus g curves with certain specified ramification data. This is classically equivalent to counting certain…
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…
A harmonic map from a Riemannian manifold into a Grassmannian manifold is characterized by a vector bundle, a space of sections of this bundle and a Laplace operator. We apply our main theorem, itself a generalization of a Theorem of…
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with graphs and relational…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
We prove upper and lower bounds for the number of zeroes of linear combinations of Schr\"odinger eigenfunctions on metric (quantum) graphs. These bounds are distinct from both the interval and manifolds. We complement these bounds by giving…
One of the most famous problems in mathematics is the Riemann hypothesis: that the non-trivial zeros of the Riemann zeta function lie on a line in the complex plane. One way to prove the hypothesis would be to identify the zeros as…