Related papers: Sparse bounds on variational norms along monomial …

We describe the effect of ramified morphisms on Harbourne constants of reduced effective divisors. With this goal, we introduce the pullback of a weighted cluster of infinitely near points under a dominant morphism between surfaces, and…

We prove sparse bounds for pseudodifferential operators associated to H\"ormander symbol classes. Our sparse bounds are sharp up to the endpoint and rely on a single scale analysis. As a consequence, we deduce a range of weighted estimates…

Let $G$ be a unipotent group and $\mathcal F=\{F_t:t\in (0,\infty)\}$ a family of subsets of $G$, with $\mathcal F$ definable in an o-minimal expansion of the real field. Given a lattice $\Gamma\subseteq G$, we study the possible Hausdorff…

Let $G$ be a connected graph of order $n$ with domination number $\gamma(G)$. Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eigenvalue $\lambda$ of $G$ with multiplicity…

\begin{abstract} We study the Morse-Smale property for the following scalar semilinear parabolic equation on the circle $S^1$, \begin{equation*} u_{t}=u_{xx}+f(t,u,u_{x}),\,\,t>0,\,x\in S^{1}=\mathbb{R}/2\pi \mathbb{Z}, \end{equation*}…

Let $\gamma$ be a smooth, non-closed, simple curve whose image is symmetric with respect to the $y$-axis, and let $D$ be a planar domain consisting of the points on one side of $\gamma$, within a suitable distance $\delta$ of $\gamma$.…

We prove a general sparse domination theorem in a space of homogeneous type, in which a vector-valued operator is controlled pointwise by a positive, local expression called a sparse operator. We use the structure of the operator to get…

Let $\gamma(G)$ denote the domination number of a graph $G$. A {\it Roman domination function} of a graph $G$ is a function $f: V\to\{0,1,2\}$ such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number}…

The Standard Model calculation of $H\rightarrow\gamma\gamma$ has the curious feature of being finite but regulator-dependent. While dimensional regularization yields a result which respects the electromagnetic Ward identities, additional…

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

We consider a family of non-local and non-convex functionals, and we prove that their Gamma-liminf is bounded from below by a positive multiple of the Sobolev norm or the total variation. As a by-product, we answer some open questions…

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…

We estudy the $H^{p}(\mathbb{Z})$ - $\ell^{q}(\mathbb{Z})$ boundedness of the fractional series operator $T_{\gamma}$ given by \[ (T_{\gamma}b)(j) = \sum_{i \neq \pm j} \frac{b(i)}{|i-j|^{\alpha}|i+j|^{\beta}}, \] where $0 \leq \gamma < 1$,…

We prove that for every positive integer $r$ and for every graph class $\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\mathcal G$. Moreover, when $\mathcal G$ is only assumed to be…

We say that a $d$-regular graph is a $\gamma$-expander if for every not too large set of vertices $S$, there are at least $\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\gamma$-far from bipartite if at least $\gamma e(G)$…

The {\em independent domination number} $\gamma^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $\gamma^i$ is equal…

In this expository article, we briefly survey the main known schemes of proof of sparse domination principles within harmonic analysis. We then use the one based on the Calder\'on-Zygmund decomposition to prove a dual sparse domination…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

Using the Calder\'on-Zygmund decomposition, we give a novel and simple proof that $L^2$ bounded dyadic shifts admit a domination by positive sparse forms with linear growth in the complexity of the shift. Our estimate, coupled with…

A symmetric branching random walk (BRW) on a free group $\mathbb{F}$ is transient if and only if the mean offspring number $r$ does not exceed $R$, the reciprocal of the spectral radius of the underlying random walk. In this regime, the…