×

Some betweenness relation topologies induced by simplicial complexes. (English) Zbl 1513.54005

Summary: This article aims to create an approximation space from any simplicial complex by representing a finite simplicial complex as a union of its components. These components are arranged into levels beginning with the highest-dimensional simplices. The universal set of the approximation space is comprised of a collection of all vertices, edges, faces, and tetrahedrons, and so on. Moreover, new types of upper and lower approximations in terms of a betweenness relation will be defined. A betweenness relation means that an element lies between two elements: an upper bound and a lower bound. In this work, based on H.-P. Zhang’s et al. [Topology Appl. 258, 100–114 (2019; Zbl 1412.06001)] concept, a betweenness relation on any simplicial complex, which produces a set of order relations, is established and some of its topologies are studied.

MSC:

54A05 Topological spaces and generalizations (closure spaces, etc.)
54F05 Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces
06A06 Partial orders, general
60L20 Rough paths
92C50 Medical applications (general)

Citations:

Zbl 1412.06001
Full Text: DOI

References:

[1] F.G. Arenas, Alexandroff spaces, Acta Math. Univ. Comenian. (N.S.), 68 (1), 17-25, 1999. · Zbl 0944.54018
[2] L.M. Blumenthal and D.O. Ellis, Notes on lattices, Duke Math. J. 16, 585-590, 1949. · Zbl 0035.30103
[3] D. Cavaliere, S. Senatore and V. Loia, Context-a ware profiling of concepts from a semantic topological space, Knowledge-Based Systems, 130, 102-115, 2017.
[4] V. Chvátal, Sylvester-Gallai theorem and metric betweenness, Discrete Comput. Geom. 31, 175-195, 2004. · Zbl 1053.51006
[5] N. Düvelmeyer and W, Wenzel, A characterization of ordered sets and lattices via betweenness relations, Results Math. 46, 237-250, 2004. · Zbl 1084.06002
[6] A. El Atik, Reduction based on similarity and decision-making, J. Egyptian Math. Soc. 28 (22), 1-12, 2020. · Zbl 1457.94058
[7] A. El Atik and H. Hassan, Some nano topological structures via ideals and graphs, J. Egyptian Math. Soc. 28 (41), 1-21, 2020. · Zbl 1460.54009
[8] A. El Atik and A. Nasef, Some topological structures of fractals and their related graphs, Filomat, 34 (1), 153-165, 2020. · Zbl 1499.54135
[9] E. Estrada and G.J. Ross, Centralities in simplicial complexes, Applications to protein interaction, J. Theoret. Biol. 438, 46-60, 2018. · Zbl 1394.92040
[10] E.V. Huntington, A new set of postulates for betweenness, with proof of complete independence, Trans. Amer. Math. Soc. 26, 257-282, 1924. · JFM 50.0025.02
[11] E.V. Huntington and J.R. Kline, Sets of independent postulates for betweenness, Trans. Amer. Math. Soc. 18, 301-325, 1917. · JFM 46.1429.02
[12] F. Klein, Vorlesungen äber höhere Geometrie 22, Springer-Verlag, 2013.
[13] E.F. Lashin, A.M. Kozae, A.A. Khadra, and T. Medhat, Rough set theory for topological spaces, Internat. J. Approx. Reason. 40 (1-2), 35-43, 2005. · Zbl 1099.68113
[14] S.A. Morris, Topology without tears, University of New England, 1989.
[15] M. Pasch, Vorlesunges über neuere geometrie, 23, Teubner, Leipzig, Berlin, 1882. · JFM 14.0498.01
[16] Z. Pawlak, Rough sets, Int. J. Comput. Inf. Sci. 11 (5), 341-356, 1982. · Zbl 0501.68053
[17] Z. Pawlak, Rough set approach to knowledge-based decision support, European J. Oper. Res. 99 (1), 48-57, 1997. · Zbl 0923.90004
[18] R. Pérez-Fernández and B. De Baets, On the role of monometrics in penalty-based data aggregation, IEEE Trans. Fuzzy Sys. 27 (7), 1456-1468, 2018.
[19] M.F. Smiley and W.R. Transue, Applications of transitivities of betweenness in lattice theory, Bull. Amer. Math. Soc. 49, 280-287, 1943. · Zbl 0060.06405
[20] B. Stolz, Computational topology in neuro science, M.Sc. thesis, University of Oxford, London-England, 2014.
[21] H.P. Zhang, R.P. Fernandez and B.D. Baets, Topologies induced by the representation of a betweenness relation as a family of order relations, Topology Appl. 258, 100-114, 2019. · Zbl 1412.06001
[22] L. Zuffi, Simplicial complexes from graphs towards graph persistence, M.Sc. thesis, Universita di Bologna, 2015/2016.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.