Results 21 to 30 of about 3,484,215 (187)
On the omega-limit sets of tent maps [PDF]
, 2011 For a continuous map f on a compact metric space (X,d), a subset D of X is internally chain transitive if for every x and y in D and every delta > 0 there is a sequence of points {x=x_0,x_1, ...,x_n=y} such that d(f(x_i),x_{i+1}) < delta for i=0,1, ...,n-
Barwell, Andrew +2 more
core +2 more sources
Criterion of Completeness and Submaximal Ultraclones for Linear Hyperfunctions of Rank 2
Известия Иркутского государственного университета: Серия "Математика", 2023 In recent years, the direction associated with the study of maps from a finite set A to the set of all subsets of the set A, including the empty one, has been intensively developing. Such mappings are called multifunctions on A, as well as hyperfunctions
I.K. Sharankhaev
doaj +1 more source
On ordinally closed sets [PDF]
Proceedings of the American Mathematical Society, 1978 Extensions of Cantor’s Intersection Theorem and Zalcwasser’s theorem on transfinite sequences of ambiguous sets of the first Baire class are given for linear sets.
openaire +2 more sources
On g*s-Closed Functions in Topological Spaces [PDF]
Engineering and Technology Journal, 2014 Pushpalatha and K. Anitha [1] introduce a new concept of functions which is g*s-closed function in topological spaces. In this paper, we modify this concept and study the properties of some types of these functions.
Salim dawood Mohisn
doaj +1 more source
On Classes of Hyperfunctions of Rank 2 Generated by Maximal Multiclones
Известия Иркутского государственного университета: Серия "Математика", 2017 The research of multifunctions is a one of the directions in discrete function’s investigations. Multifunction is a discrete function from a finite set A to all subsets of A. The set of hyperfunctions is a subset of set of multifunctions.
A.S. Zinchenko, V.I. Panteleyev
doaj +1 more source
Classification of Multioperations of Rank 2 by E-precomplete Sets
Известия Иркутского государственного университета: Серия "Математика", 2020 In this paper multioperations defined on a two-element set and their closure operator based on composition operator and the equality predicate branching operator is considered. The composition operator is based on union of sets.
V.I. Panteleev, L.V. Ryabets
doaj +1 more source
Closed Baire sets are (sometimes) zero-sets [PDF]
Proceedings of the American Mathematical Society, 1970 It is a theorem essentially due to Paul Halmos [H, 51.D] that each compact Baire set is a zero-set. Kenneth A. Ross and Karl Stromberg [RS] have shown (a bit more than the fact that) if X X is a completely regular Hausdorff space which is locally compact and σ \sigma -compact, then each closed Baire set in X
openaire +1 more source
Set Covering with Our Eyes Closed [PDF]
SIAM Journal on Computing, 2008 Given a universe U of n elements and a weighted collection l of m subsets of U, the universal set cover problem is to a-priori map each element u epsi U to a set S(u) epsi l containing u, so that X sube U is covered by S(X)=UuepsiXS(u). The aim is finding a mapping such that the cost of S(X) is as close as possible to the optimal set-cover cost for X. (
GRANDONI, FABRIZIO +5 more
openaire +5 more sources
Uniqueness of Area Minimizing Surfaces for Extreme Curves
, 2012 Let M be a compact, orientable, mean convex 3-manifold with boundary. We show that the set of all simple closed curves in the boundary of M which bound unique area minimizing disks in M is dense in the space of simple closed curves in the boundary of M ...
Coskunuzer, Baris, Etgü, Tolga
core +1 more source
All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs
, 2004 We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per set generated;
Byskov J. M. +4 more
core +1 more source