相关论文: Sharp variational inequalities for the Hardy-Littl…
Let $G=(V,E)$ be a finite graph and $M_G$ be the centered Hardy-Littlewood maximal operator defined there. We find the optimal value $\bf{C}_{G,p}$ such that the inequality $$\text{Var}_{p}(M_{G}f)\leq {\textbf{C}}_{G,p}\text{Var}_{p}(f)$$…
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 different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having 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…
The purpose of the paper is to establish weighted maximal $L_p$-inequalities in the context of operator-valued martingales on semifinite von Neumann algebras. The main emphasis is put on the optimal dependence of the $L_p$ constants on the…
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…
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 best constants in several dilation invariant integral inequalities involving derivatives of functions. Some of these inequalities are new and some were known without best constants. The contents: 1. Estimate for a quadratic form of…
In this paper, we establish discrete Hardy-Rellich inequalities on $\mathbb{N}$ with $\Delta^\frac{\ell}{2}$ and optimal constants, for any $\ell \geq 1$. As far as we are aware, these sharp inequalities are new for $\ell \geq 3$. Our…
For any two real-valued continuous-path martingales $X=\{X_t\}_{t\geq 0}$ and $Y=\{Y_t\}_{t\geq 0}$, with $X$ and $Y$ being orthogonal and $Y$ being differentially subordinate to $X$, we obtain sharp $L^p$ inequalities for martingales of…
We give a direct proof of the operator valued Hardy-Littlewood maximal inequality for $2<p<\infty$.
Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.
In this thesis, we study problems at the interface of analysis and discrete mathematics. We discuss analogues of well known Hardy-type inequalities and Rearrangement inequalities on the lattice graphs $\mathbb{Z}^d$, with a particular focus…
When studying the weighted Hardy-Rellich inequality in $L^2$ with the full gradient replaced by the radial derivative the best constant becomes trivially larger or equal than in the first situation. Our contribution is to determine the new…
In this paper, we prove a $p$-Hardy inequality on the discrete half-line with weights $n^{\alpha}$ for all real $p > 1$. Building on the work of Miclo for $p = 2$ and Muckenhoupt in the continuous settings, we develop a quantitative…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…
In this paper, we study pointwise estimates for linear and multilinear pseudo-differential operators with exotic symbols in terms of the Fefferman-Stein sharp maximal function and Hardy-Littlewood type maximal function. Especially in the…
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…
The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some…