Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > General Topology

arXiv:1805.03041 (math)
[Submitted on 8 May 2018 (v1), last revised 2 Jan 2020 (this version, v4)]

Title:Equivalent Conditions for Digital Covering Maps

Authors:Ali Pakdaman, Mehdi Zakki
View PDF
Abstract:In this paper we show that a digital $(\kappa,\lambda)-$continuous surjection $p:(E,\kappa)\rightarrow (B,\lambda)$ is a digital covering map if and only if it is a local isomorphism. Moreover, we find a loop criterion for a digital covering map to be an $n$-radius covering. Also, we show that every digitally continuous map with unique path lifting property is a digital covering map if it has no conciliator point.
Subjects: General Topology (math.GN)
Cite as: arXiv:1805.03041 [math.GN]
  (or arXiv:1805.03041v4 [math.GN] for this version)
  https://doi.org/10.48550/arXiv.1805.03041

Submission history

From: Ali Pakdaman [view email]
[v1] Tue, 8 May 2018 14:13:47 UTC (12 KB)
[v2] Mon, 7 Jan 2019 04:48:00 UTC (12 KB)
[v3] Wed, 18 Sep 2019 11:54:15 UTC (1 KB) (withdrawn)
[v4] Thu, 2 Jan 2020 07:28:42 UTC (13 KB)
Full-text links:

Access Paper:

view license
Current browse context:
math.GN
< prev   |   next >
new | recent | 2018-05
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)