Related papers: Sharp Inequalities for maximal operators on finite…

Let $G$ be a simple connected graph on $n$ vertices, and let $\lambda_1(G),\lambda_2(G),\ldots,\lambda_n(G)$ be the eigenvalues of its adjacency matrix $A(G)$. For $p>0$, define the $p$-energy of $G$ by $\mathcal E_p(G)=\sum_{i=1}^n…

In \cite{MR447956}, Muckenhoupt and Wheeden formulated a weighted weak $(p,p)$ inequality where the weight for the weak $L^p$ space is treated as a multiplier rather than a measure. They proved such inequalities for the Hardy-Littlewood…

Weighted inequality on the Hardy-Littlewood maximal function is completely understood while it is not well understood for the spherical maximal function. For the power weight $|x|^{\alpha}$, it is known that the spherical maximal operator…

Let $X$ be a supermartingale starting from $0$ which has only nonnegative jumps. For each $0<p<1$ we determine the best constants $c_p$, $C_p$ and $\mathfrak{c}_p$ such that $$ \,\,\,\,\sup_{t\geq 0}\left|\left|X_t\right|\right|_p\leq…

We prove sharp $L^p(w)$ norm inequalities for the intrinsic square function (introduced recently by M. Wilson) in terms of the $A_p$ characteristic of $w$ for all $1<p<\infty$. This implies the same sharp inequalities for the classical…

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…

For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says that equality holds for complete graphs.…

Assume that $p\in[1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^n)$ and $u(0) = 0$. Then we obtain the sharp inequality $|u(x)|\le G_p(|x|)\|\phi\|_{L^{p}}$ for some smooth function $G_p$ vanishing at $0$.…

We obtain sharp estimates for the localized distribution function of M\phi, when \phi belongs to Lp,\inf where M is the dyadic maximal operator. We obtain these estimates given the L1 and Lq norm, q < p and certain weak Lp-conditions.

We consider the orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Gamma)$, where $\Gamma$ is a connected graph of genus $g>1$, embedded in $S^3$. For each $g$ we give the maximum order $m_g$ of such $G$ acting on $(S^3,…

More than thirty years ago, Erd\H{o}s, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no…

Let $G$ be a distance-regular graph of order $v$ and size $e$. In this paper, we show that the max-cut in $G$ is at most $e(1-1/g)$, where $g$ is the odd girth of $G$. This result implies that the independence number of $G$ is at most…

We present several sharp upper bounds and some extension for product operators. Among other inequalities, it is shown that if , , are non-negative continuous functions on such that , , then for all non-negative operator monotone decreasing…

For $k \geq 1$ and a graph $G$ let $\nu_k(G)$ denote the size of a maximum $k$-edge-colorable subgraph of $G$. Mkrtchyan, Petrosyan and Vardanyan proved that $\nu_2(G)\geq \frac45\cdot |V(G)|$, $\nu_3(G)\geq \frac76\cdot |V(G)|$ for any…

For graphs $G$ and $H$, let $G {\displaystyle\smash{\begin{subarray}{c} \hbox{$\tiny\rm rb$} \\ \longrightarrow \\ \hbox{$\tiny\rm p$} \end{subarray}}}H$ denote the property that for every proper edge-colouring of $G$ there is a rainbow $H$…

The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal'…

Let T : Lp --> Lp be a contraction, with p strictly between 1 and infinity, and assume that T is analytic, that is, there exists a constant K such that n\norm{T^n-T^{n-1}} < K for any positive integer n. Under the assumption that T is…

We prove that maximal operators of convolution type associated to smooth kernels are bounded in the homogeneous Hardy-Sobolev spaces $\dot{H}^{1,p}(\mathbb{R}^d)$ when $1/p < 1+1/d$. This range of exponents is sharp. As a by-product of the…

Markoff mod-$p$ graphs are conjectured to be connected for all primes $p$. In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all $p > 3.448\cdot10^{392}$. We also provide a method that…