Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Josef Šlapal"'
Autor:
Josef Šlapal
Publikováno v:
Publicationes Mathematicae Debrecen. 38:39-48
Autor:
Josef Šlapal
Publikováno v:
Open Mathematics. 20:682-688
We discuss certain closure operators that generalize the Alexandroff topologies. Such a closure operator is defined for every ordinal α > 0 \alpha \gt 0 in such a way that the closure of a set A A is given by closures of certain α \alpha -indexed s
Autor:
Minani Iragi, Josef Šlapal
Publikováno v:
Aequationes mathematicae.
Autor:
Josef Šlapal
Publikováno v:
Quaestiones Mathematicae; Vol. 45 No. 4 (2022); 513-522
In the paper, we introduce the concept of a preorder on a category and study its relation to categorical closure operators. In particular, employing a Galois connection, we show that there is a one-to-one correspondence between the idempotent closure
Autor:
Josef Šlapal
Publikováno v:
Fundamenta Informaticae. 179:59-74
In this paper, we propose new definitions of digital Jordan curves and digital Jordan surfaces. We start with introducing and studying closure operators on a given set that are associated with n-ary relations (n > 1 an integer) on this set. Discussed
Autor:
Josef Šlapal
Publikováno v:
Aequationes mathematicae. 96:129-136
Given a subobject-structured category $$\mathcal X$$ , we construct a new category whose objects are the pairs (X, c) where X is an $$\mathcal X$$ -object and c is an idempotent, monotonic and extensive endomap of the subobject lattice of X, and whos
Autor:
Josef Šlapal
Publikováno v:
Filomat. 34:3229-3237
We introduce and study a closure operator on the digital plane Z2. The closure operator is shown to provide connectedness that allows for a digital analogue of the Jordan curve theorem. This enables using the closure operator for structuring the digi
Autor:
Josef Šlapal
Publikováno v:
Open Mathematics, Vol 17, Iss 1, Pp 1374-1380 (2019)
Given a simple graph with the vertex set X, we discuss a closure operator on X induced by a set of paths with identical lengths in the graph. We introduce a certain set of paths of the same length in the 2-adjacency graph on the digital line ℤ and
Autor:
Josef Šlapal
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030670764
HPCSE
HPCSE
In a simple undirected graph, we introduce a special connectedness induced by a set of paths of length 2. We focus on the 8-adjacency graph (with the vertex set \(\mathbb {Z}^2\)) and study the connectedness induced by a certain set of paths of lengt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ed36dc3204efdf33b679237a20ca758
https://doi.org/10.1007/978-3-030-67077-1_9
https://doi.org/10.1007/978-3-030-67077-1_9
Autor:
Josef Šlapal
Publikováno v:
Computational and Applied Mathematics. 39
We introduce and discuss a concept of connectedness induced by an n-ary relation ( $$n>1$$ an integer). In particular, for every integer $$n>1$$ , we define an n-ary relation $$R_n$$ on the digital line $$\mathbb {Z}$$ and equip the digital space $$\