Related papers: Sharp Inequalities for maximal operators on finite…

Let $G(n,c/n)$ and $G_r(n)$ be an $n$-node sparse random graph and a sparse random $r$-regular graph, respectively, and let ${\cal I}(n,r)$ and ${\cal I}(n,c)$ be the sizes of the largest independent set in $G(n,c/n)$ and $G_r(n)$. The…

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

Dependencies of the optimal constants in strong and weak type bounds will be studied between maximal functions corresponding to the Hardy--Littlewood averaging operators over convex symmetric bodies acting on $\mathbb R^d$ and $\mathbb…

Let $a$, $b$, and $n$ be three integers such that $1\leq a \leq b < n$, $a \equiv b$ (mod $2$), and $na$ is even. A parity $[a,b]$-factor of $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $a \leq d_H(v) \leq b$ and…

We obtain inequalities of the form $$\int_C |f(z)|^p |dz| \leq A(p) \int_{\mathbb{T}} |f(z)|^p |dz|, \quad (p>1)$$ where $f$ is harmonic in the unit disk $\mathbb{D}$, $\mathbb{T}$ is the unit circle, and $C$ is any convex curve in…

It is studied that pointwise estimates and continuities on Hardy spaces of pseudo-differential operators (PDOs for short) with the symbol in general H\"{o}rmander's classes. We get weighted weak-type $(1,1)$ estimate, weighted normal…

Let ${\frak M}^\alpha$ be the spherical maximal operators of complex order $\alpha$ on ${\mathbb R^n}$. In this article we show that when $n\geq 2$, suppose \begin{eqnarray*} \|{\frak M}^{\alpha} f \|_{L^p({\mathbb R^n})} \leq C\|f…

Let $T$ be a finite tree graph, $T^N$ be the Cartesian power graph of $T$, and $d^N$ be the graph distance metric on $T^N$. Also let \[ \mathbb S_r^N(x) := \{v \in T^N: d^N(x,v) = r\} \] be the sphere of radius $r$ centered at $x$ and $M$…

In this article we characterize all possible cases that may occur in the relations between the sets of $p$ for which weak type $(p,p)$ and strong type $(p,p)$ inequalities for the Hardy--Littlewood maximal operators, both centered and…

Let $\{T_t\}_{t>0}$ be a strongly continuous semigroup of positive contractions on $L_p(X,\mu)$ with $1<p<\infty$. Let $E$ be a UMD Banach lattice of measurable functions on another measure space $(\Omega,\nu)$. For $f\in L_p(X; E)$ define…

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…

We show that if a graph has minimum vertex degree at least d and girth at least g, where (d, g) is (3, 6) or (4, 4), then the incidence system of the graph has a (possibly infinite-dimensional) quantum solution over $\mathbb{Z}_p$ for every…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…

The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the…

We study the $L^p$ mapping properties of the strong spherical maximal function, which is a multiparameter generalisation of Stein's spherical maximal function. We show that this operator is bounded on $L^p$ for $p > 2$ in all dimensions $n…

To estimate the optimal constant in Hardy-type inequalities, some variational formulas and approximating procedures are introduced. The known basic estimates are improved considerably. The results are illustrated by typical examples. It is…

In this paper we study sharp pointwise inequalities for maximal operators. In particular, we strengthen DeVore's inequality for the moduli of smoothness and a logarithmic variant of Bennett--DeVore--Sharpley's inequality for rearrangements.…

Let $G$ be a $k$-degenerate graph of order $n.$ It is well-known that $G\ $has no more edges than $S_{n,k},$ the join of a complete graph of order $k$ and an independent set of order $n-k.$ In this note it is shown that $S_{n,k}$ is…

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

Given a graph $G$, the optimization version of the graph burning problem seeks for a sequence of vertices, $(u_1,u_2,...,u_p) \in V(G)^p$, with minimum $p$ and such that every $v \in V(G)$ has distance at most $p-i$ to some vertex $u_i$.…