2020
DOI: 10.1016/j.jmaa.2020.124430
|View full text |Cite
|
Sign up to set email alerts
|

On relation between the ideal core and ideal cluster points

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…In other words, K-core(x) = co L x , where co S is the convex hull of S ⊆ R k and L x is the set of accumulation points of x. The ideal version of the Knopp core has been studied in [16,18]. The classical Knopp theorem states that, if k = 2 and A is a nonnegative regular matrix, then K-core(Ax) ⊆ K-core(x) (5) for all bounded sequences x, where Ax = (A n x : n ≥ 1), see [17, p. 115]; cf.…”
Section: •2 Regular Matricesmentioning
confidence: 99%
“…In other words, K-core(x) = co L x , where co S is the convex hull of S ⊆ R k and L x is the set of accumulation points of x. The ideal version of the Knopp core has been studied in [16,18]. The classical Knopp theorem states that, if k = 2 and A is a nonnegative regular matrix, then K-core(Ax) ⊆ K-core(x) (5) for all bounded sequences x, where Ax = (A n x : n ≥ 1), see [17, p. 115]; cf.…”
Section: •2 Regular Matricesmentioning
confidence: 99%
“…It is worth noting that -cluster points have been studied much before under a different name. Indeed, as it follows by [16, Theorem 4.2] and [14, Lemma 2.2], they correspond to classical “cluster points” of a filter (depending on ) on the underlying space (cf. [2, Definition 2, p. 69]).…”
Section: Introductionmentioning
confidence: 99%
“…It is worth noting that I-cluster points have been studied much before under a different name. Indeed, as it follows by [14,Theorem 4.2] and [12,Lemma 2.2], they correspond to classical "cluster points" of a filter (depending on x) on the underlying space, cf. [2, Definition 2, p.69].…”
Section: Introductionmentioning
confidence: 99%