Related papers: Weierstrass-Enneper representation for Maximal Sur…
We develop a new method of solving Bethe-Salpeter (BS) equation in Minkowski space. It is based on projecting the BS equation on the light-front (LF) plane and on the Nakanishi integral representation of the BS amplitude. This method is…
In the present paper which a sequel to dg-ga/9511005 and dg-ga//9610013 a global Weierstrass representation of an arbitrary closed oriented surface of genus $\geq 1$ in the the three-space is constructed. The Weierstrass spectrum of a torus…
The Penrose inequality in Minkowski is a geometric inequality relating the total outer null expansion and the area of closed, connected and spacelike codimension-two surfaces S in the Minkowski spacetime, subject to an additional convexity…
Concerning the value distribution problem for generalized Gauss maps, we not only generalize Fujimoto's theorem to complete space-like stationary surfaces in Minkowski spacetime, but also estimate the upper bound of the number of…
A well-known theorem of Wolpert shows that the Weil-Petersson symplectic form on Teichm\"uller space, computed on two infinitesimal twists along simple closed geodesics on a fixed hyperbolic surface, equals the sum of the cosines of the…
In this paper, the Weierstrass technique for harmonic maps S^2 -> CP^(N-1) is employed in order to obtain surfaces immersed in multidimensional Euclidean spaces. It is shown that if the CP^(N-1) model equations are defined on the sphere S^2…
The paper presents a generalized Weierstrass representation for pseudospherical surfaces in terms of 3x3 matrices, using moving frames and loop group decompositions. The construction of all such surfaces, starting from a given…
It is known that minimal surfaces in Euclidean space can be represented in terms of holomorphic functions. For example, we have the well-known Weierstrass representation, where part of the holomorphic data is chosen to be the stereographic…
We introduce, for every $\mathbb{Z}$-graded manifold, a formal exponential map defined in a purely algebraic way and study its properties. As an application, we give a simple new construction of a Fedosov type resolution of the algebra of…
We propose a discrete transport equation on graphs which connects distributions on both vertices and edges. We then derive a discrete analogue of the Benamou-Brenier formulation for Wasserstein-$1$ distance on a graph and as a result…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
In this paper, we study the Dirichlet problem associated to the maximal surface equation. We prove the uniqueness of bounded solutions to this problem in unbounded domain in R^2.
A novel Gromov-Wasserstein learning framework is proposed to jointly match (align) graphs and learn embedding vectors for the associated graph nodes. Using Gromov-Wasserstein discrepancy, we measure the dissimilarity between two graphs and…
Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…
We show that a simple geometric result suffices to derive the form of the optimal solution in a large class of finite and infinite-dimensional maximum entropy problems concerning probability distributions, spectral densities and covariance…
In this paper we describe all rotation $H$-hypersurfaces in $H^n \times R$ and use them as barriers to prove existence and characterization of certain vertical $H$-graphs and to give symmetry and uniqueness results for compact…
We prove a Gauss-Bonnet formula for the extrinsic curvature of complete surfaces in hyperbolic space under some assumptions on the asymptotic behaviour. The result is given in terms of the measure of geodesics intersecting the surface…
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…
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
Hypergraphs capture multi-way relationships in data, and they have consequently seen a number of applications in higher-order network analysis, computer vision, geometry processing, and machine learning. In this paper, we develop…