Related papers: Sharp inequalities for maximal operators on finite…

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

We prove that the Hardy--Littlewood maximal operator $M$ is bounded on the variable Lebesgue space $L^{p(\cdot)}(X,d,\mu)$, with $1<p_-\le p_+<\infty$, over an unbounded space of homogeneous type $(X,d,\mu)$ with a Borel-semiregular measure…

We investigate $L^p$ boundedness of the maximal function defined by the averaging operator $f\to \mathcal{A}_t^s f$ over the two-parameter family of tori $\mathbb{T}_t^{s}:=\{ ( (t+s\cos\theta)\cos\phi,\,(t+s\cos\theta)\sin\phi,\,…

Let $(X,d,\mu)$ be a space of homogeneous type and $p(\cdot):X\to[1,\infty]$ be a variable exponent. We show that if the measure $\mu$ is Borel-semiregular and reverse doubling, then the condition ${\rm ess\,inf}_{x\in X}p(x)>1$ is…

One of the cornerstones of extremal graph theory is a result of F\"uredi, later reproved and given due prominence by Alon, Krivelevich and Sudakov, saying that if $H$ is a bipartite graph with maximum degree $r$ on one side, then there is a…

Let $S_n=K[x_1,\ldots,x_n,y]$ and $I_n=(x_1y,x_2y,\ldots,x_ny)\subset S_n$ be the edge ideal of star graph. We prove that $\operatorname{hdepth}(S_n/I_n)\geq \left\lceil \frac{n}{2} \right\rceil + \left\lfloor \sqrt{n} \right\rfloor - 2$.…

Given a discrete function $f:\Z^d \to \R$ we consider the maximal operator $$Mf(\vec{n}) = \sup_{r\geq0} \frac{1}{N(r)} \sum_{\vec{m} \in \bar{\Omega}_r} \big|f(\vec{n} + \vec{m})\big|,$$ where $\big\{\bar{\Omega}_r\big\}_{r \geq 0}$ are…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\delta(H)>0$ and $\Delta(H)$ denote the minimum degree and maximum degree of $H$,…

The underlying motivation of the present work lies on a cornerstone question in spectral optimization that consists of determining sharp lower and upper uniform estimates for fundamental frequencies of a set of uniformly elliptic operators…

We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let c_{infty}(G) denote the…

We study the regularity of the bilinear maximal operator when applied to Sobolev functions, proving that it maps $W^{1,p}(\mathbb{R}) \times W^{1,q}(\mathbb{R}) \to W^{1,r}(\mathbb{R})$ with $1 <p,q < \infty$ and $r\geq 1$, boundedly and…

We study the complexity of local graph centrality estimation, with the goal of approximating the centrality score of a given target node while exploring only a sublinear number of nodes/arcs of the graph and performing a sublinear number of…

We provide an example of a pair of weights $(u,v)$ for which the Hardy-Littlewood maximal function is bounded from $L^p(v)$ to $L^p(u)$ and from $L^{p'}(u^{1-p'})$ to $L^{p'}(v^{1-p'})$ while a dyadic sparse operator is not bounded on the…

We use the Hardy spaces for Fourier integral operators to obtain bounds for spherical maximal functions in $L^{p}(\mathbb{R}^{n})$, $n\geq2$, where the radii of the spheres are restricted to a compact interval in $(0,\infty)$. These bounds…

Dense subgraph discovery is an important problem in graph mining and network analysis with several applications. Two canonical problems here are to find a maxcore (subgraph of maximum min degree) and to find a densest subgraph (subgraph of…

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…

Let d \geq d_0 be a sufficiently large constant. A (n,d,c \sqrt{d}) graph G is a d-regular graph over n vertices whose second largest (in absolute value) eigenvalue is at most c \sqrt{d}. For any 0 < p < 1, G_p is the graph induced by…

We investigate the threshold $p_{\vec H}=p_{\vec H}(n)$ for the Ramsey-type property $G(n,p)\to \vec H$, where $G(n,p)$ is the binomial random graph and $G\to\vec H$ indicates that every orientation of the graph $G$ contains the oriented…

We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at…