Related papers: Sharp Inequalities for maximal operators on finite…

Let $M_{G}$ be the centered Hardy-Littlewood maximal operator on a finite graph $G$. We find $\underset{p\to \infty}{\lim}\|M_{G}\|_{p}^{p }$ when $G$ is the start graph ($S_n$) and the complete graph ($K_n$), and we fully describe…

Let $K_n=(V,E)$ be the complete graph with $n\geq 3$ vertices (here $V$ and $E$ denote the set of vertices and edges of $K_n$ respectively). We find the optimal value ${\bf{C}}_{n,p}$ such that the inequality $$\|f-m_f\|_p\le {\bf…

We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…

We study sharp $p$-variational inequalities for the Hardy-Littlewood maximal operator on complete graphs, answering in the affirmative a question by Feng Liu and Qingying Xue. We also use computational assistance to find sharp constants in…

For $1<p<\infty$ and $M$ the centered Hardy-Littlewood maximal operator on $\mathbb{R}$, we consider whether there is some $\varepsilon=\varepsilon(p)>0$ such that $\|Mf\|_p\ge (1+\varepsilon)||f||_p$. We prove this for $1<p<2$. For $2\le…

Let $1<p<\infty$. We prove that there exists an $\varepsilon_p>0$ such that for each $f\in L^p(\mathbb{R})$, the centered Hardy-Littlewood maximal operator $M$ on $\mathbb{R}$ satisfies the lower bound $\|Mf\|_{L^p(\mathbb{R})}\ge…

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

We give a direct proof of the operator valued Hardy-Littlewood maximal inequality for $2<p<\infty$.

Given a multigraph $G$, the all-terminal reliability $R(G,p)$ is the probability that $G$ remains connected under percolation with parameter $p$. Fixing the number of vertices $n$ and edges $m$, we investigate which graphs maximize $R(G,p)$…

Let $(X,\mathcal{B}, \mu, T)$ be an ergodic dynamical system on a non-atomic finite measure space. We assume without loss of generality that $\mu(X)=1.$ Consider the maximal function $\dis R^*:(f, g) \in L^p\times L^q \to R^*(f, g)(x) =…

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

For a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-universal if $G$ contains every graph in $\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most…

Let $M$ denote the centered Hardy--Littlewood operator on $\mathbb{R}$. We prove that \[ {\rm Var} (Mf)\le {\rm Var} (f) - \frac12\big| |f(\infty)|-|f(-\infty)|\big| \] for piecewise constant functions $f$ with nonzero and zero values…

For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$,…

In this paper we prove and discuss some new $\left( H_{p},L_{p}\right)$ type inequalities of maximal operators of $T$ means with respect to the Vilenkin systems with monotone coefficients. We also apply these inequalities to prove strong…

We study the boundedness problem for maximal operators $\mathbb{M}$ associated to averages along families of finite type curves in the plane, defined by $$\mathbb{M}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{\mathbb{C}} f(x-ty) \,…

We show that for a graph $G$ with the vertex set $V$ and the largest eigenvalue $\lambda_{\max}(G)$, letting $$ M(G) := \max_{X,Y \subset V} \frac{e(X,Y)}{\sqrt{|X||Y|}} $$ (where $e(X,Y)$ denotes the number of edges between $X$ and $Y$),…

The best constant in the usual Lp norm inequality for the centered Hardy-Littlewood maximal function on R1 is obtained for the class of all ``peak-shaped'' functions. A positive function on the line is called ``peak-shaped'' if it is…

We find the exact value of the best possible constant $C$ for the weak type $(1,1)$ inequality for the one dimensional centered Hardy-Littlewood maximal operator. We prove that $C$ is the largest root of the quadratic equation…

Let $a$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \in V(G)$, $d_H(v)$ is even and $a \le d_H(v) \le b$. Matsuda conjectured that if $G$ is an $n$-vertex…