IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i9p946-d542083.html
   My bibliography  Save this article

Sharp Inequalities for the Hardy–Littlewood Maximal Operator on Finite Directed Graphs

Author

Listed:
  • Xiao Zhang

    (College of Mathematics and System Science, Shandong University of Science and Technology, Qingdao 266590, China)

  • Feng Liu

    (College of Mathematics and System Science, Shandong University of Science and Technology, Qingdao 266590, China)

  • Huiyun Zhang

    (College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China)

Abstract

In this paper, we introduce and study the Hardy–Littlewood maximal operator M G → on a finite directed graph G → . We obtain some optimal constants for the ℓ p norm of M G → by introducing two classes of directed graphs.

Suggested Citation

  • Xiao Zhang & Feng Liu & Huiyun Zhang, 2021. "Sharp Inequalities for the Hardy–Littlewood Maximal Operator on Finite Directed Graphs," Mathematics, MDPI, vol. 9(9), pages 1-17, April.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:9:p:946-:d:542083
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/9/946/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/9/946/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Feng Liu & Xiao Zhang, 2022. "Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs," Mathematics, MDPI, vol. 10(6), pages 1-21, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:9:p:946-:d:542083. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.