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

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 946
Author(s):  
Xiao Zhang ◽  
Feng Liu ◽  
Huiyun Zhang
Keyword(s):  
Directed Graph ◽  
Maximal Operator ◽  
Directed Graphs ◽  
Optimal Constants ◽  
Finite Directed Graphs ◽  
Littlewood Maximal Operator

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

On the regularity of the Hardy-Littlewood maximal operator on subdomains of ℝn

2010 ◽  
Vol 53 (1) ◽  
pp. 211-237 ◽  
Author(s):  
Hannes Luiro
Keyword(s):  
Maximal Operator ◽  
Littlewood Maximal Operator

AbstractWe establish the continuity of the Hardy-Littlewood maximal operator on W1,p(Ω), where Ω ⊂ ℝn is an arbitrary subdomain and 1 < p < ∞. Moreover, boundedness and continuity of the same operator is proved on the Triebel-Lizorkin spaces Fps,q (Ω) for 1 < p,q < ∞ and 0 < s < 1.

scholarly journals The Boundedness of the Hardy-Littlewood Maximal Operator and Multilinear Maximal Operator in Weighted Morrey Type Spaces

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Takeshi Iida
Keyword(s):  
Maximal Function ◽  
Maximal Operator ◽  
Morrey Spaces ◽  
Weighted Morrey Spaces ◽  
Type Spaces ◽  
Multilinear Maximal Function ◽  
Multilinear Maximal Operator ◽  
Littlewood Maximal Operator

The aim of this paper is to prove the boundedness of the Hardy-Littlewood maximal operator on weighted Morrey spaces and multilinear maximal operator on multiple weighted Morrey spaces. In particular, the result includes the Komori-Shirai theorem and the Iida-Sato-Sawano-Tanaka theorem for the Hardy-Littlewood maximal operator and multilinear maximal function.

Weak-Type Boundedness of the Hardy–Littlewood Maximal Operator on Weighted Lorentz Spaces

2016 ◽  
Vol 22 (6) ◽  
pp. 1431-1439 ◽  
Author(s):  
Elona Agora ◽  
Jorge Antezana ◽  
María J. Carro
Keyword(s):  
Maximal Operator ◽  
Weak Type ◽  
Lorentz Spaces ◽  
Weighted Lorentz Spaces ◽  
Littlewood Maximal Operator

scholarly journals An example of a space Lp(x) on which the Hardy-Littlewood maximal operator is not bounded

2001 ◽  
Vol 19 (4) ◽  
pp. 369-371 ◽  
Author(s):  
Luboš Pick ◽  
Michael Růžička
Keyword(s):  
Maximal Operator ◽  
Littlewood Maximal Operator

scholarly journals On Directed Versions of the Hajnal–Szemerédi Theorem

2015 ◽  
Vol 24 (6) ◽  
pp. 873-928 ◽  
Author(s):  
ANDREW TREGLOWN
Keyword(s):  
Directed Graph ◽  
Minimum Degree ◽  
Directed Graphs ◽  
Perfect Matchings ◽  
Large Order ◽  
Vertex Disjoint ◽  
Removal Lemma

We say that a (di)graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. The seminal Hajnal–Szemerédi theorem characterizes the minimum degree that ensures a graph G contains a perfect Kr-packing. In this paper we prove the following analogue for directed graphs: Suppose that T is a tournament on r vertices and G is a digraph of sufficiently large order n where r divides n. If G has minimum in- and outdegree at least (1−1/r)n then G contains a perfect T-packing.In the case when T is a cyclic triangle, this result verifies a recent conjecture of Czygrinow, Kierstead and Molla [4] (for large digraphs). Furthermore, in the case when T is transitive we conjecture that it suffices for every vertex in G to have sufficiently large indegree or outdegree. We prove this conjecture for transitive triangles and asymptotically for all r ⩾ 3. Our approach makes use of a result of Keevash and Mycroft [10] concerning almost perfect matchings in hypergraphs as well as the Directed Graph Removal Lemma [1, 6].

A model for generation of directed graphs of information by the directed graph of metainformation for a two-level model of information units with a complex structure

2015 ◽  
Vol 49 (6) ◽  
pp. 221-231 ◽  
Author(s):  
V. V. Gribova ◽  
A. S. Kleshchev ◽  
F. M. Moskalenko ◽  
V. A. Timchenko
Keyword(s):  
Directed Graph ◽  
Directed Graphs ◽  
Complex Structure ◽  
Level Model ◽  
Two Level Model

Boundedness of the Hardy–Littlewood Maximal Operator Along the Orbits of Contractive Similitudes

2012 ◽  
Vol 23 (4) ◽  
pp. 1832-1850 ◽  
Author(s):  
Hugo Aimar ◽  
Marilina Carena ◽  
Bibiana Iaffei
Keyword(s):  
Maximal Operator ◽  
Littlewood Maximal Operator

scholarly journals Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model

2020 ◽  
Author(s):  
Gábor Kusper ◽  
Csaba Biró
Keyword(s):  
Directed Graph ◽  
Directed Graphs ◽  
Deep Insight ◽  
Communication Graph ◽  
Sat Problem ◽  
Weak Model ◽  
Know How ◽  
Black And White ◽  
Communication Graphs ◽  
Strongly Connected

In a previous paper we defined the Black-and-White SAT problem which has exactly two solutions, where each variable is either true or false. We showed that Black-and-White $2$-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonbogl\'{a}r model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a Black-and-White SAT problem. We prove a powerful theorem, the so called Transitions Theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as Blask-and-White SAT problems. We show that the Balatonbogl\'{a}r model is between the strong and the weak model, and it generates $3$-SAT problems, so the Balatonbogl\'{a}r model represents strongly connected communication graphs as Black-and-White $3$-SAT problems. Our motivation to study these models is the following: The strong model generates a $2$-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonbogl\'{a}r model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonbogl\'{a}r model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: SAT problem and directed graphs.

scholarly journals Active Semantic Relations in Layered Enterprise Architecture Development

2021 ◽  
pp. 3-16
Author(s):  
Matt Baxter ◽  
Simon Polovina ◽  
Wim Laurier ◽  
Mark von Rosing
Keyword(s):  
Directed Graph ◽  
Enterprise Architecture ◽  
Directed Graphs ◽  
Building Blocks ◽  
Semantic Relations ◽  
Formal Concept ◽  
General Applicability ◽  
Conceptual Graph ◽  
Architecture Development

AbstractEnterprise Architecture (EA) metamodels align an organisation’s business, information and technology resources so that these assets best meet the organisation’s purpose. The Layered EA Development (LEAD) Ontology enhances EA practices by a metamodel with layered metaobjects as its building blocks interconnected by semantic relations. Each metaobject connects to another metaobject by two semantic relations in opposing directions, thus highlighting how each metaobject views other metaobjects from its perspective. While the resulting two directed graphs reveal all the multiple pathways in the metamodel, more desirable would be to have one directed graph that focusses on the dependencies in the pathways. Towards this aim, using CG-FCA (where CG refers to Conceptual Graph and FCA to Formal Concept Analysis) and a LEAD case study, we determine an algorithm that elicits the active as opposed to the passive semantic relations between the metaobjects resulting in one directed graph metamodel. We also identified the general applicability of our algorithm to any metamodel that consists of triples of objects with active and passive relations.

Sign in / Sign up

Export Citation Format

Share Document