Related papers: On the Structure of Isometrically Embeddable Metri…
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes. If these…
In this paper we examine different aspects of the geometry of closed conformal vector fields on Riemannian manifolds. We begin by getting obstructions to the existence of closed conformal and nonparallel vector fields on complete manifolds…
A vector field on a Riemannian manifold is called geodesic if its integral curves are reparametrized geodesics. We classify compact K\"ahler manifolds admitting nontrivial real-holomorphic geodesic gradient vector fields that satisfy an…
We present an introduction to the geometry of higher order vector and co--vector bundles (including higher order generalizations of the Finsler geometry and Kaluza--Klein gravity) and review the basic results on Clifford and spinor…
We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize…
Starting with a regular symmetric Dirichlet form on a locally compact separable metric space $X$, our paper studies elements of vector analysis, $L_p$-spaces of vector fields and related Sobolev spaces. These tools are then employed to…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
This paper presents a generalization of symplectic geometry to a principal bundle over the configuration space of a classical field. This bundle, the vertically adapted linear frame bundle, is obtained by breaking the symmetry of the full…
The study of symmetries in the realm of manifolds can be approached in two different ways. On one hand, Killing vector fields on a (pseudo-)Riemannian manifold correspond to the directions of local isometries within it. On the other hand,…
A piecewise flat Finsler metric on a triangulated surface $M$ is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of…
We are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. We assume $\Omega$ to be Lebesgue measurable with regular boundary and contained,…
Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks. However, it also incurs challenges arising from the fact that linear subspaces do not obey Euclidean geometry, but lie on a special…
Extending Stallings' foldings of trees, we show in this article that every parallel-preserving map between median graphs factors as an isometric embedding through a sequence of elementary transformations which we call foldings and…
Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very…
Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…
It is shown that the Hilbert geometry $(D,h_D)$ associated to a bounded convex domain $D\subset \mathbb{E}^n$ is isometric to a normed vector space $(V,||\cdot ||)$ if and only if $D$ is an open $n$-simplex. One further result on the…
We give an application of a topological dynamics version of multidimensional Brown's lemma to tiling theory: given a tiling of an Euclidean space and a finite geometric pattern of points $F$, one can find a patch such that, for each scale…
Our goal is to efficiently compute low-dimensional latent coordinates for nodes in an input graph -- known as graph embedding -- for subsequent data processing such as clustering. Focusing on finite graphs that are interpreted as uniform…
We introduce the {\em pair-cut cone $PCUT_n$} of metrics on sets with $n\ge 3$ elements, that correspond to linear combinations with non-negative coefficients of the cut-metrics resulting from cuts that are pairs. Given a metric, we fully…