In this paper the concepts of weakly (resp., closure, strongly) Perfect Mappings are defined and the important relationships are studied: (a) Comparison between deferent forms of perfect mappings. (b) Relationship between compositions of deferent forms of perfect mappings. (c) Investigate relationships between deferent forms of perfect mappings and their graphs mappings.
Abstract. In this work, some new concepts were introduced and the relationship between them was studied. These concepts are filter directed-toward, nano-closure-directed-toward and nano-closure-converge to point, and some theories and results about these concepts were presented. A definition almost-nano-converges for set, almost-nano-cluster-point, and definition of quasi-nano-Hausdorff-closed and was also called nano-Hausdorff-closed relative, were also presented several theories related to these definitions were presented and the relationship between them was studied . We also provided other generalizations, including nano closure continuous mappings and it was also called as nano-weaklycontinuous- mappings, as well as providing a definit
... Show MoreLet M be a n-dimensional manifold. A C1- map f : M M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.
Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation on a set can always be represented by a digraph. Topology on a set can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.
In this paper, the Normality set will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of .
in this paper, we give a concept of
The main purpose of this paper is to study feebly open and feebly closed mappings and we proved several results about that by using some concepts of topological feebly open and feebly closed sets , semi open (- closed ) set , gs-(sg-) closed set and composition of mappings.
In this article, we recalled different types of iterations as Mann, Ishikawa, Noor, CR-iteration and, Modified SP_iteration of quasi δ-contraction mappings, and we proved that all these iterations equivalent to approximate fixed points of δ-contraction mappings in Banach spaces.
In this article, we will present a quasi-contraction mapping approach for D iteration, and we will prove that this iteration with modified SP iteration has the same convergence rate. At the other hand, we prove that the D iteration approach for quasi-contraction maps is faster than certain current leading iteration methods such as, Mann and Ishikawa. We are giving a numerical example, too.