Related papers: Variants on Digital Covering Maps
In numerous applicative contexts, data are too rich and too complex to be represented by numerical vectors. A general approach to extend machine learning and data mining techniques to such data is to really on a dissimilarity or on a kernel…
We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity,…
The CR analogue of B.-Y. Chen's conjecture on pseudo biharmonic maps will be shown. Pseudo biharmonic, but not pseudo harmonic, isometric immersions with parallel pseudo mean curvature vector fields, will be characterized. Several examples…
In this paper, we consider holomorphic mappings between real hypersurfaces in different dimensional complex spaces. We give a number of conditions that imply that such mappings are transversal to the target hypersurface at most points.
In this study, we give definition of some multivalued hybrid mappings which are general than many mappings in the existing literature, then we give some existence and convergence results for these mappings in CAT({\kappa})-spaces
Inversion of various inclusions, that characterize continuity in topological spaces, results in numerous variants of quotient and perfect maps. In the framework of convergences, the said inclusions are no longer equivalent, and each of them…
In this note we discuss some arithmetic and geometric questions concerning self maps of projective algebraic varieties.
Many mathematicians encounter k-to-1 maps only in the study of covering maps. But, of course, k-to-1 maps do not have to be open. This paper touches on covering maps, and simple maps, but concentrates on ordinary k-to-1 functions (both…
An approach to the equivalence problem of vector valued maps is offered which, in particular, covers the equivalence problem of paths and patches of differential geometry with respect to different motion groups. In the last case, in…
This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
Along with the rapid growth of autonomous vehicles (AVs), more and more demands are required for environment perception technology. Among others, HD mapping has become one of the more prominent roles in helping the vehicle realize essential…
Tactile maps are commonly used to give visually impaired users access to geographical representations. Although those relief maps are efficient tools for acquisition of spatial knowledge, they present several limitations and issues such as…
This paper provides an overview of modern digital geometry and topology through mathematical principles, algorithms, and measurements. It also covers recent developments in the applications of digital geometry and topology including image…
In this paper, by reviewing the concept of semicovering maps, we present some conditions under which a local homeomorphism becomes a semicovering map. We also obtain some conditions under which a local homeomorphism is a covering map.
In this paper we study to alternative rings the almost additivity of the Lie multiplicative and Lie triple derivable maps.
For digital images, there is an established homotopy equivalence relation which parallels that of classical topology. Many classical homotopy equivalence invariants, such as the Euler characteristic and the homology groups, do not remain…
This is a survey article on distance-squared mappings and related topics.
We study properties of Cartesian products of digital images, using a variety of adjacencies that have appeared in the literature.