Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/2342
DC FieldValueLanguage
dc.contributor.authorM. Kostic, D. Velinoven_US
dc.date.accessioned2019-06-21T00:34:00Z-
dc.date.available2019-06-21T00:34:00Z-
dc.date.issued2019-
dc.identifier.issn0351-336X-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/2342-
dc.description.abstractThe paper intends to be a heuristical study. Let $(m_n)$ be an increasing sequence in $[1,\infty)$ satisfying $\lim_{n\rightarrow\infty}\frac{m_n}{n}$, $\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,\tilde{X})$-distributional chaos of type s, reiterative $(\lambda, \tilde{X})$-distributional chaos of type s, reiterative $[\tilde{X},m_n,i]$-distributional chaos and reiterative $[\tilde{X},\lambda,i]$-distributional chaos for general sequences of binary relations over metric spaces.en_US
dc.description.sponsorshipMinistry of Science and Technological Development, Republic of Serbiaen_US
dc.language.isoenen_US
dc.publisherUnion of Mathematicians of Macedoniaen_US
dc.relationGrant 174024en_US
dc.relation.ispartofMatematicki Biltenen_US
dc.subjectreiterative (m_n)-distributional chaos of type s, reiterative $\lambda$-distributional chaos of type s, reiterative $[\tilde{X},m_n,i]$-distributional chaos, reiterative $[\tilde{X},\lambda, i]$-distributional chaos, binary relations.en_US
dc.titleReiterative (m_n)-distributional chaos for binary relations over metric spacesen_US
dc.typeArticleen_US
dc.identifier.eissn1857-9914-
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:Faculty of Civil Engineering: Journal Articles
Show simple item record

Page view(s)

107
checked on Apr 24, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.