Related papers: Sharp inequalities for maximal operators on finite…

For $r\geq 2$ and $p\geq 1$, the $p$-spectral radius of an $r$-uniform hypergraph $H=(V,E)$ on $n$ vertices is defined to be $$\rho_p(H)=\max_{{\bf x}\in \mathbb{R}^n: \|{\bf x}\|_p=1}r \cdot \!\!\!\! \sum_{\{i_1,i_2,\ldots, i_r\}\in E(H)}…

The systematic study of Tur\'an-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. arXiv:2001.00849. They conjectured that the extremal functions of edge-ordered forests of order chromatic number 2 are…

For integers $k,n$ with $1 \le k \le n/2$, let $f(k,n)$ be the smallest integer $t$ such that every $t$-connected $n$-vertex graph has a spanning bipartite $k$-connected subgraph. A conjecture of Thomassen asserts that $f(k,n)$ is upper…

We construct optimal Hardy weights to subcritical energy functionals $h$ associated with quasilinear Schr\"odinger operators on locally finite graphs. Here, optimality means that the weight $w$ is the largest possible with respect to a…

In this paper we establish $L^p$ boundedness properties for maximal operators, Littlewood-Paley functions and variation operators involving Poisson semigroups and resolvent operators associated with nonsymmetric Ornstein-Uhlenbeck…

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…

Fine-grained reductions have established equivalences between many core problems with $\tilde{O}(n^3)$-time algorithms on $n$-node weighted graphs, such as Shortest Cycle, All-Pairs Shortest Paths (APSP), Radius, Replacement Paths, Second…

We obtain a necessary and sufficient condition on an exponent $p(\cdot)$ for which the Hardy--Littlewood maximal operator is bounded on the variable $L^{p(\cdot)}$ space. It is formulated in terms of the Muckenhoupt-type condition…

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

Let $\mathcal{M}(\mathbb{R}^n)$ be the class of bounded away from one and infinity functions $p:\mathbb{R}^n\to[1,\infty]$ such that the Hardy-Littlewood maximal operator is bounded on the variable Lebesgue space…

Let $(X,\mathcal{B}, \mu, T)$ be an ergodic dynamical system on a non-atomic finite measure space. We assume without loss of generality that $\mu(X)=1.$ Consider the maximal function $\dis R^*:(f, g) \in L^p\times L^q \to R^*(f, g)(x) =…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…

In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in undirected graphs. For unweighted graphs, we provide an algorithm for $2$-approximate APSP in $\tilde O(n^{2.5-r}+n^{\omega(r)})$ time, for any…

In this paper we prove and discuss some new $\left( H_{p},L_{p}\right)$ type inequalities of maximal operators of $T$ means with respect to the Vilenkin systems with monotone coefficients. We also apply these inequalities to prove strong…

Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…

In this paper we study the boundedness on $L^p(w)$ of the maximal operator $M_{A^{-1}}$, defined by $M_{A^{-1}}f(x)=Mf(A^{-1}x)$, that is, the maximal of Hardy-Littlewood composed with a invertible matrix $A$. We present two different…

We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…

For $p\ge 2$, and $\lambda>\max\{n|\tfrac 1p-\tfrac 12|-\tfrac12, 0\}$, we prove the pointwise convergence of cone multipliers, i.e. $$ \lim_{t\to\infty}T_t^\lambda(f)\to f \text{ a.e.},$$ where $f\in L^p(\mathbb R^n)$ satisfies $supp\…