Multiset topologies induced by multiset relations (Q454961): Difference between revisions

A \textit{multiset} is a collection of objects (called \textit{elements}), in which elements may occur more than once (see, e.g., [\textit{W. D. Blizard}, Notre Dame J. Formal Logic 30, No. 1, 36--66 (1989; Zbl 0668.03027)]). An example of multisets is provided by the collection of prime factors of a positive integer \(n\), i.e., \(504=2^3\cdot3^2\cdot7^1\). Based in the notion of multiset, the authors introduce the concept of multiset topology (Definition 3.1 on page 302), provide multiset analogues of basis concepts related to topological spaces (i.e., subbasis, as well as interior, closure, and neighborhood operators). They also consider binary multiset relations, and show a way of generating multiset topologies from them (paying particular attention to the study of the connection between properties of relations (like, e.g., being symmetric or transitive) and properties of their induced topologies). The paper ends with some brief remarks on rough multisets and their generated multiset topologies (Section 9). The article is well-written and conveniently self-contained. All its achievements, however, are quite simple (rather straightforward generalizations of classical notions and results of general topology), and, moreover, most of them have already appeared in print in [\textit{K. P. Girish} and \textit{S. J. John}, Lect. Notes Comput. Sci. 6600, 62--80 (2011; Zbl 1305.68166)].