REITERATIVE (m_{n})-DISTRIBUTIONAL CHAOS FOR BINARY RELATIONS OVER METRIC SPACES
DOI:
https://doi.org/10.37560/matbil119005kKeywords:
reiterative \((m_n)\)-distributional chaos of type \(s\), reiterative \(\lambda\)-distributional chaos of type \(s\), reiterative \([\widetilde{X},m_n,i]\)-distributional chaos, reiterative \([\widetilde{X},\lambda,i]\)-distributional chaos, binary relationsAbstract
This paper intends to be a heuristical study. Let \((m_n)\) be an increasing sequence in \([1,\infty)\) satisfying \(\liminf_{n\to\infty}\frac{m_n}{n}>0\), \(\lambda\in(0,1]\), \(s\in\{0,1-,1+,2-\}\) and \(i\in\mathbb{N}\cap[1,20]\). We introduce and analyze the concepts of reiterative \((m_n,\widetilde{X})\)-distributional chaos of type \(s\), reiterative \((\lambda,\widetilde{X})\)-distributional chaos of type \(s\), reiterative \([\widetilde{X},m_n,i]\)-distributional chaos and reiterative \([\widetilde{X},\lambda,i]\)-distributional chaos for general sequences of binary relations over metric spaces.
Downloads
Published
Issue
Section
License
Copyright (c) 2019 Matematichki Bilten

This work is licensed under a Creative Commons Attribution 4.0 International License.