سال انتشار: ۱۳۸۵

محل انتشار: شانزدهمین سمینار آنالیز ریاضی و کاربردهای آن

تعداد صفحات: ۳

نویسنده(ها):

FATEMEH GHANE –

چکیده:

The notion of strong chain recurrency first introduced by Easton which was stronger than chain recurrency. In this talk, we obtain some results on strong chain recurrency. We show that strong chain recurrent components are closed and invariant, and in the generic case, the strong chain recurrent set is equal to chain recurrent set. Moreover, generically, each chain transitive set is a strong chain transitive.