Related papers: On equivalence of vector-valued maps
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar.…
We study a realization of motion and similarity group equivalence classes of $n\geq 1$ labeled points in $\mathbb R^k,\, k\geq 1$ as a metric space with a computable metric. Our study is motivated by applications in computer vision.
We use mass-transportation as a tool to compare surfaces (2-manifolds). In particular, we determine the "similarity" of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation…
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar. This leads…
In this paper directional derivative sets and differentials of a given set valued map are studied. Relations between the set valued map and compact subsets of the directional derivative sets of the given map are investigated. Upper and…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
In this note we discuss some arithmetic and geometric questions concerning self maps of projective algebraic varieties.
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…
In this paper we consider the variable inequality problem, that is, to find a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system…
The exponential map that characterises the flows of vector fields is the key in understanding the basic structural attributes of control systems in geometric control theory. However, this map does not exists due to the lack of completeness…
The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…
We classify equivariant topological complex vector bundles over real projective plane under a compact Lie group (not necessarily effective) action. It is shown that nonequivariant Chern classes and isotropy representations at (at most)…
The purpose of this paper is to study the equivalence relation on unitary bases defined by R. F. Werner [{\it J. Phys. A: Math. Gen.} {\bf 34} (2001) 7081], relate it to local operations on maximally entangled vectors bases, find an…
We introduce a class of "Lipschitz horizontal" vector fields in homogeneous groups, for which we show equivalent descriptions, e.g. in terms of suitable derivations. We then investigate the associated Cauchy problem, providing a uniqueness…
Theorems on the existence of vector fields with given sets of Indexes of isolated Singular points are proved for the cases of closed manifolds, pairs of manifolds, manifolds with boundary, and gradient fields. It is proved that, on a…
We introduce several sufficient conditions to guarantee the existence of the Milnor vector field for new classes of singularities of map germs. This special vector field is related with the equivalence problem of the Milnor fibrations for…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as…
Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…