1999
DOI: 10.1216/rmjm/1181071681
|View full text |Cite
|
Sign up to set email alerts
|

On Hankel Convolution Equations in Distribution Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2000
2000
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…The study of Hankel convolution equations on distributions of slow growth and of exponential growth was developed in [4] and [7]. In this paper we analyze the hypoellipticity of Hankel convolution equations defined by elements of E * in the space D * .…”
Section: Introduction and Statement Of The Resultmentioning
confidence: 99%
“…The study of Hankel convolution equations on distributions of slow growth and of exponential growth was developed in [4] and [7]. In this paper we analyze the hypoellipticity of Hankel convolution equations defined by elements of E * in the space D * .…”
Section: Introduction and Statement Of The Resultmentioning
confidence: 99%
“…In this section we present necessary and sufficient conditions on a distribution S ∈ E(w) in order that B(w) #S = B(w) , that is, for every R ∈ B(w) there exists T ∈ B(w) for which T #S = R. Solvability of Hankel convolution equations in Zemanian distribution spaces was studied in [7], and on distribution with exponential growth in [9]. We now establish our main result.…”
Section: Surjectivity Of Hankel Convolution Operators On Beurling-typmentioning
confidence: 94%
“…Assume now that S ∈ H µ,∞ . To see that |a j | = o(ξ n j ), as j → ∞, for every n ∈ N, we proceed as in the proof of [6,Proposition 3.2]. Let k ∈ N and φ ∈ S e .…”
Section: Hypoellipticity Of Hankel Convolution Equationsmentioning
confidence: 99%
“…where x, y ∈ [0, ∞) and f, g ∈ L 1 (x 2µ+1 dx). The Hankel convolution was studied in distribution spaces in [5], [6] and [12]. In the sequel, to simplify we will write #, τ x , x ∈ [0, ∞), and D, instead # µ , µ τ x , x ∈ [0, ∞), and D µ , respectively.…”
Section: Introductionmentioning
confidence: 99%