2019
DOI: 10.1007/s13348-019-00262-5
|View full text |Cite
|
Sign up to set email alerts
|

The Kolmogorov–Riesz theorem and some compactness criterions of bounded subsets in weighted variable exponent amalgam and Sobolev spaces

Abstract: We study totally bounded subsets in weighted variable exponent amalgam and Sobolev spaces. Moreover, this paper includes several detailed generalized results of some compactness criterions in these spaces.2000 Mathematics Subject Classification. Primary 46E35, 43A15, 46E30.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 28 publications
(43 reference statements)
0
4
0
Order By: Relevance
“…This theorem has several extensions to different function spaces with standard translation, see e.g. [7], [15], [25], [26], [40], [29] and with Bessel and Laguerre translations, see [30]. In all but one of our examples the translation is not symmetric.…”
Section: Regularity With Respect To Compactnessmentioning
confidence: 79%
“…This theorem has several extensions to different function spaces with standard translation, see e.g. [7], [15], [25], [26], [40], [29] and with Bessel and Laguerre translations, see [30]. In all but one of our examples the translation is not symmetric.…”
Section: Regularity With Respect To Compactnessmentioning
confidence: 79%
“…; l q by Theorem 2.1 in [34]. ii) Also, if we follow Theorem 3.8 in [34], Theorem 2.3 in [9], Theorem 5.11 in [10], and Theorem 8 in [1], then we have that…”
mentioning
confidence: 90%
“…The space ( ) ( ) is a reflexive Banach space with respect to ‖ ‖ ( ) . Moreover, the dual space of ( ) ( ) is isometrically isomorphic to ( ) ( ), where ( ) ( ) and ( ) (see [18][19][20]). The relations between the modular ( ) ( ) and ‖ ‖ ( ) are given in the following theorem (see [19,[21][22]).…”
Section: Theorem 3 Let ( ) ( )mentioning
confidence: 99%