نتایج جستجو برای: a minimal set
تعداد نتایج: 13484987 فیلتر نتایج به سال:
In this paper the notion of limit average shadowing property is introduced for diffeomorphisms on a compact smooth manifold M and a class of diffeomorphisms is given which has the limit average shadowing property, but does not have the shadowing property. Moreover, we prove that for a closed f-invariant set Lambda of a diffeomorphism f, if Lambda is C1-stably limit average shadowing and t...
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
let h be a separable hilbert space and let b be the set of bessel sequences in h. by using several interesting results in operator theory we study some topological properties of frames and riesz bases by constructing a banach space structure on b. the convergence of a sequence of elements in b is de_ned and we determine whether important properties of the sequence is preserved under the con...
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
the space now known as complete erdos space ec was introduced by paul erdos in 1940 as the closed subspace of the hilbert space ?2 consisting of all vectors such that every coordinate is in the convergent sequence {0} ? { 1 n : n ? n}. in a solution to a problem posed by lex g. oversteegen we present simple and useful topological characterizations of ec. as an application we determine the ...
The structure of the semi lattice of enumeration degrees has been investigated from many aspects. One aspect is the bounding and nonbounding properties of generic degrees. Copestake proved that every 2-generic enumeration degree bounds a minimal pair and conjectured that there exists a 1-generic set that does not bound a minimal pair. In this paper we verify this longstanding conjecture by cons...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید