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

Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs

Author

Listed:
  • Feng Liu

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

  • Xiao Zhang

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

Abstract

In this paper, the authors establish the bounds for the Hardy-Littlewood maximal operator defined on a finite directed graph G → in the space BV p ( G → ) of bounded p -variation functions. More precisely, the authors obtain the BV p norms of M G → for some directed graphs G → .

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:950-:d:772441
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/6/950/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/6/950/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:10:y:2022:i:6:p:950-:d:772441. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.