English
Related papers

Related papers: Sparse bounds on variational norms along monomial …

200 papers

Answering a key point left open in a recent work of Bongers, Guo, Li and Wick, we provide the following lower bound $$ \|b\|_{\text{BMO}_{\gamma}(\mathbb{R}^2)}\lesssim \|[b,H_{\gamma}]\|_{L^p(\mathbb{R}^2)\to L^p(\mathbb{R}^2)}, $$ where…

Classical Analysis and ODEs · Mathematics 2023-02-07 Tuomas Oikari

For any natural number $k$, consider the $k$-linear Hilbert transform $$ H_k( f_1,\dots,f_k )(x) := \operatorname{p.v.} \int_{\bf R} f_1(x+t) \dots f_k(x+kt)\ \frac{dt}{t}$$ for test functions $f_1,\dots,f_k: {\bf R} \to {\bf C}$. It is…

Classical Analysis and ODEs · Mathematics 2015-06-01 Terence Tao

The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…

Dynamical Systems · Mathematics 2015-10-12 C. Davis Buenger

We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…

High Energy Physics - Theory · Physics 2021-03-04 Frank Ferrari

Diffusion kernels over graphs have been widely utilized as effective tools in various applications due to their ability to accurately model the flow of information through nodes and edges. However, there is a notable gap in the literature…

Numerical Analysis · Mathematics 2026-04-15 Giuseppe Alessio D'Inverno , Kylian Ajavon , Simone Brugiapaglia

Let $r>\frac{4}{3}$ and let $\Omega \in L^{r}(\mathbb{S}^{2n-1})$ have vanishing integral. We show that the bilinear rough singular integral $$T_{\Omega}(f,g)(x)= \textrm{p.v.}…

Classical Analysis and ODEs · Mathematics 2020-09-08 Loukas Grafakos , Zhidan Wang , Qingying Xue

For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number,…

Combinatorics · Mathematics 2015-08-03 Randy Davila , Caleb Fast , Michael Henning , Franklin Kenter

Given a simple graph $G$, a dominating set in $G$ is a set of vertices $S$ such that every vertex not in $S$ has a neighbor in $S$. Denote the domination number, which is the size of any minimum dominating set of $G$, by $\gamma(G)$. For…

Combinatorics · Mathematics 2020-07-09 Randy Davila , Elliot Krop

Suppose $f(x,y) + \frac{\kappa}{2} \|x\|^2 - \frac{\sigma}{2}\|y\|^2$ is convex where $\sigma>0$, and the argmin function $\gamma(x) = \{ \gamma : \inf_y f(x,y) = f(x,\gamma)\}$ exists and is single valued. We will prove $\gamma$ is…

Analysis of PDEs · Mathematics 2019-05-31 Julius Ross , David Witt Nyström

We prove that the length of the boundary of a $J$-holomorphic curve with Lagrangian boundary conditions is dominated by a constant times its area. The constant depends on the symplectic form, the almost complex structure, the Lagrangian…

Symplectic Geometry · Mathematics 2014-09-30 Yoel Groman , Jake P. Solomon

By virtue of $\Gamma-$convergence arguments, we investigate the stability of variational eigenvalues associated with a given topological index for the fractional $p$-Laplacian operator, in the singular limit as the nonlocal operator…

Analysis of PDEs · Mathematics 2022-02-24 Lorenzo Brasco , Enea Parini , Marco Squassina

We complete the $L^p$ boundedness theory of commutators of Hilbert transforms along monomial curves by providing the previously missing lower bounds. This optimal result now covers all monomial curves while previous results had significant…

Classical Analysis and ODEs · Mathematics 2024-03-14 Kangwei Li , Henri Martikainen , Tuomas Oikari

We prove a sparse bound in the context of Schauder theory for divergence form elliptic partial differential equations. In addition, we show how an iteration argument inspired by sparse domination bounds can be used to deduce gradient…

Analysis of PDEs · Mathematics 2026-01-21 Olli Saari , Yuanlin Sun , Hua-Yang Wang , Yuanhong Wei

In this paper we obtain a pointwise sparse domination for generalized H\"ormander operators and also for iterated commutators with those operators. As a particular case of our result we obtain a extension of the sparse domination for…

Classical Analysis and ODEs · Mathematics 2018-06-04 Gonzalo H. Ibañez-Firnkorn , Israel P. Rivera-Ríos

We say that a graph $G$ has the Ramsey property w.r.t.\ some graph $F$ and some integer $r\geq 2$, or $G$ is $(F,r)$-Ramsey for short, if any $r$-coloring of the edges of $G$ contains a monochromatic copy of $F$. R{\"o}dl and Ruci{\'n}ski…

Combinatorics · Mathematics 2018-02-16 Torsten Mütze , Ueli Peter

Given a lattice \Gamma in a locally compact group G and a closed subgroup H of G, one has a natural action of \Gamma on the homogeneous space V=H\G. For an increasing family of finite subsets {\Gamma_T: T>0}, a dense orbit v\Gamma, v\in V,…

Dynamical Systems · Mathematics 2016-09-07 Alexander Gorodnik , Barak Weiss

We show that any Littlewood--Paley square function $S$ satisfying a minimal local testing condition is dominated by a sparse form, \begin{equation*} \langle (Sf)^2,g \rangle\le C \sum_{I \in \mathscr{S}} \langle \lvert f\rvert\rangle_I^2…

Classical Analysis and ODEs · Mathematics 2020-11-03 Gianmarco Brocchi

The $\gamma$-graph of a graph $G$ is the graph whose vertices are labelled by the minimum dominating sets of $G$, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size $\gamma(G)$) intersect in a…

Combinatorics · Mathematics 2020-04-06 Matt DeVos , Adam Dyck , Jonathan Jedwab , Samuel Simon

Let $L$ be a proper differentiation invariant subspace of $C^\infty(a,b)$ such that the restriction operator $\frac{d}{dx}\bigl{|}_L$ has a discrete spectrum $\Lambda$ (counting with multiplicities). We prove that $L$ is spanned by…

Complex Variables · Mathematics 2013-12-31 Alexandru Aleman , Anton Baranov , Yurii Belov

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…

Data Structures and Algorithms · Computer Science 2025-07-01 Jakub Balabán , Daniel Mock , Peter Rossmanith