2022
DOI: 10.1016/j.exmath.2021.12.001
|View full text |Cite
|
Sign up to set email alerts
|

Ultradifferentiable extension theorems: A survey

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 66 publications
0
10
0
Order By: Relevance
“…The standard definition of ultra-differentiable functions involves Denjoy-Carleman sequences, that is, real sequences satisfying certain conditions which act as bounds on the successive derivatives of a given function. However, the above definition, introduced by Braun-Meise-Taylor ( [6]), can be linked to Denjoy-Carleman classes (see [12], Theorem 11.6). Since Fourier series appear naturally in the problem considered here, we chose to use Braun-Meise-Taylor classes as a starting point.…”
Section: Ultra-differentiabilitymentioning
confidence: 99%
“…The standard definition of ultra-differentiable functions involves Denjoy-Carleman sequences, that is, real sequences satisfying certain conditions which act as bounds on the successive derivatives of a given function. However, the above definition, introduced by Braun-Meise-Taylor ( [6]), can be linked to Denjoy-Carleman classes (see [12], Theorem 11.6). Since Fourier series appear naturally in the problem considered here, we chose to use Braun-Meise-Taylor classes as a starting point.…”
Section: Ultra-differentiabilitymentioning
confidence: 99%
“…Here are some easy consequences of the definition: M j M k ≤ M j+k , (M k ) 1/k ≤ µ k , and (M k ) 1/k → ∞ if and only if µ k → ∞ (cf. [27,Lemma 2.3]).…”
Section: Ultradifferentiable Classes and Weightsmentioning
confidence: 99%
“…see e.g. [7], [35,Section 4], or [27,Theorem 11.17]. Then the class and the weight function ω are called quasianalytic, and non-quasianalytic otherwise.…”
Section: Weight Functionsmentioning
confidence: 99%
See 1 more Smart Citation
“…where N is given by ( 16) and µ |N , M |N are obtained from µ |∞ , M |∞ simply by setting all elements with index ≥ N + 1 equal to ∞. In particular, the bound on the number of zeros in (17) depends only on the derivatives up order N of f .…”
Section: 2mentioning
confidence: 99%