Related papers: Variants on Digital Covering Maps
This paper considers generalizations of open mappings, closed mappings, pseudo-open mappings, and quotient mappings from topological spaces to generalized topological spaces. Characterizations of these classes of mappings are obtained and…
Land cover mapping is essential for monitoring global environmental change and managing natural resources. Unfortunately, traditional classification models are plagued by limited training data available in existing land cover products and…
In this paper, we address the problem of reconstructing coverage maps from path-loss measurements in cellular networks. We propose and evaluate two kernel-based adaptive online algorithms as an alternative to typical offline methods. The…
We give some basic properties of strongly topologically transitive, supermixing, and hypermixing maps on general topological spaces. Then we present some other results for which our mappings need to be continuous.
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
We prove several new transversality results for formal CR maps between formal real hypersurfaces in complex space. Both cases of finite and infinite type hypersurfaces are tackled in this note.
We continue the work of [10], studying properties of digital images determined by fixed point invariants. We introduce pointed versions of invariants that were introduced in [10]. We introduce freezing sets and cold sets to show how the…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
As a generalization of slant Riemannian maps (Sahin), semi-slant Riemannian maps (Park), almost h-slant submersions (Park 2012), and almost h-semi-slant submersions (Park 2011), we introduce the notion of almost h-semi-slant Riemannian maps…
This paper continues a series in which we study deficiencies in previously published works concerning fixed point assertions for digital images.
In this survey, 37 questions on point-countable covers and sequence-covering mappings are listed, in which some of these questions have been answered. These questions are mainly related to the theory of generalized metric spaces, involving…
A technique is developed using patent information available online (at the US Patent and Trademark Office) for the generation of Google Maps. The overlays indicate both the quantity and quality of patents at the city level. This information…
We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, while the whole subvariety is not. Several…
The number of distinct maps (pre-maps) with a single vertex and valence $d$ is computed for any value of $d$. The types of maps (pre-maps) that we consider depend on whether the underlaying graph (pre-graph) is signed or unsigned and…
We adapt the study of hyperspaces and function spaces from classical topology to digital topology. We define digital hyperspaces and digital function graphs, and study some of their relationships and graphical properties.
Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces. We show that in many cases, researchers using these tools have…
In ``Rips complexes and covers in the uniform category'' the authors define, following James, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform…
We establish a characterization of the extraordinary dimension of perfect maps between metrizable spaces.
It is often the case that a covering map of the open annulus is semiconjugate to a map of the circle of the same degree. We investigate this possibility and its consequences on the dynamics. In particular, we address the problem of the…
The Weil pairing on elliptic curves has deep links with discrete logarithm problems. In practice, to better suit the functionalities of cryptosystems, one often needs to modify the original Weil pairing via what is called a distortion map.…