Regularization by continuous mappings

1971 ◽  
Vol 11 (6) ◽  
pp. 288-291
Author(s):  
V.A. Vinokurov
Keyword(s):  
Filomat ◽  
2017 ◽  
Vol 31 (11) ◽  
pp. 3507-3517
Author(s):  
Abhijit Pant ◽  
R.P. Pant ◽  
Kuldeep Prakash

The aim of the present paper is to study the dynamics of a class of orbitally continuous non-linear mappings defined on the set of real numbers and to apply the results on dynamics of functions to obtain tests of divisibility. We show that this class of mappings contains chaotic mappings. We also draw Julia sets of certain iterations related to multiple lowering mappings and employ the variations in the complexity of Julia sets to illustrate the results on the quotient and remainder. The notion of orbital continuity was introduced by Lj. B. Ciric and is an important tool in establishing existence of fixed points.


2020 ◽  
Vol 18 (1) ◽  
pp. 1478-1490
Author(s):  
Ankit Gupta ◽  
Abdulkareem Saleh Hamarsheh ◽  
Ratna Dev Sarma ◽  
Reny George

Abstract New families of uniformities are introduced on UC(X,Y) , the class of uniformly continuous mappings between X and Y, where (X,{\mathcal{U}}) and (Y,{\mathcal{V}}) are uniform spaces. Admissibility and splittingness are introduced and investigated for such uniformities. Net theory is developed to provide characterizations of admissibility and splittingness of these spaces. It is shown that the point-entourage uniform space is splitting while the entourage-entourage uniform space is admissible.


2020 ◽  
Vol 1591 ◽  
pp. 012066
Author(s):  
Mohammed Nokhas Murad Kaki ◽  
Reyadh. D. Ali

2005 ◽  
Vol 5 (3) ◽  
Author(s):  
Marina Pireddu ◽  
Fabio Zanolin

AbstractWe prove a fixed point theorem for continuous mappings which satisfy a compression-expansion condition on the boundary of a N-dimensional cell of ℝ


Author(s):  
Zukhra T. Zhukovskaya ◽  
Sergey E. Zhukovskiy

We consider the problem of a double fixed point of pairs of continuous mappings defined on a convex closed bounded subset of a Banach space. It is shown that if one of the mappings is completely continuous and the other is continuous, then the property of the existence of fixed points is stable under contracting perturbations of the mappings. We obtain estimates for the distance from a given pair of points to double fixed points of perturbed mappings. We consider the problem of a fixed point of a completely continuous mapping on a convex closed bounded subset of a Banach space. It is shown that the property of the existence of a fixed point of a completely continuous map is stable under contracting perturbations. Estimates of the distance from a given point to a fixed point are obtained. As an application of the obtained results, the solvability of a difference equation of a special type is proved.


This paper contributes new numerical invariants to the topology of a certain class of polyhedra. These invariants, together with the Betti numbers and coefficients of torsion, characterize the homotopy type of one of these polyhedra. They are also applied to the classification of continuous mappings of an ( n + 2)-dimensional polyhedron into an ( n + 1)-sphere ( n > 2).


2021 ◽  
pp. 2676-2684
Author(s):  
S. T. Ekram ◽  
R. N. Majeed

Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.


2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Robert Šámal

International audience We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with chromatic number, bipartite density, and other graph parameters. We find the value of our parameter for a family of graphs based on hypercubes. These graphs play for our parameter the role that cliques play for the chromatic number and Kneser graphs for the fractional chromatic number. The fact that the defined parameter attains on these graphs the correct value suggests that our definition is a natural one. In the proof we use the eigenvalue bound for maximum cut and a recent result of Engström, Färnqvist, Jonsson, and Thapper [An approximability-related parameter on graphs – properties and applications, DMTCS vol. 17:1, 2015, 33–66]. We also provide a polynomial time approximation algorithm based on semidefinite programming and in particular on vector chromatic number (defined by Karger, Motwani and Sudan [Approximate graph coloring by semidefinite programming, J. ACM 45 (1998), no. 2, 246–265]).


2009 ◽  
Vol 33 (1) ◽  
pp. 16-25
Author(s):  
A.A. Nouh ◽  
M.E. EL-Shafei ◽  
M. Abo-ELhamayel
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document