On a covering problem related to the centered Hardy--Littlewood maximal inequality (Q1426918): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Remarks on the Hardy–Littlewood maximal function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the one-dimensional maximal function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Research Problems in Complex Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the centered Hardy-Littlewood maximal operator / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The best constant for the centered Hardy-Littlewood maximal inequality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak type (1,1) inequalities of maximal convolution operators / rank | |||
Normal rank |
Latest revision as of 16:04, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a covering problem related to the centered Hardy--Littlewood maximal inequality |
scientific article |
Statements
On a covering problem related to the centered Hardy--Littlewood maximal inequality (English)
0 references
15 March 2004
0 references
In [\textit{A. Melas}, Trans. Am. Math. Soc. 354, No. 8, 3263--3273 (2002; Zbl 1015.42015)] and [\textit{A. Melas}, Ann. Math. (2) 157, No. 2, 647--688 (2003; Zbl 1055.42013)] it was introduced a geometric covering problem that was used to find the best possible bound in the weak type (1,1) inequality for the centered Hardy-Littlewood maximal operator. In this paper the author considers a generalization of this covering problem on the real line and finds the best possible constant associated with it. The proof is based on a discretization of the covering problem and on the establishment of an equivalent problem of combinatorial nature.
0 references
covering problem
0 references
centered Hardy-Littlewood maximal operator
0 references