Search arXivSearch

arXiv · 2008.12660

Limiting weak-type behaviors for factional maximal operators and fractional integrals with rough kernel

Abstract

By a reduction method, the limiting weak-type behaviors of factional maximal operators and fractional integrals are established without any smoothness assumption on the kernel, which essentially improve and extend previous results. As a byproduct, we characterize the boundedness of several operators by the membership of their kernel in Lebesgue space on sphere.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guoping Zhao, Weichao Guo. 2020-09-13. Limiting weak-type behaviors for factional maximal operators and fractional integrals with rough kernel. https://arxiv.org/abs/2008.12660

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Evolution of weights on a connected finite graph

On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein distance related to two probability measures and certain graph distance. Here the probability measure may be chosen as an $α$-lazy one-step random walk, an $α$-lazy two-step random walk, or a general probability measure. Based on the ODE theory, we show that the initial value problem has a unique global solution. A discrete version of the above evolution is applied to the problem of community detection. Our algorithm is based on such a discrete evolution, where probability measures are chosen as $α$-lazy one-step random walk and $α$-lazy two-step random walk respectively. Note that the latter measure has not been used in previous works. Moreover, only one surgery needs to be performed after the last iteration, which makes our algorithm much simpler than earlier ones based on Lin-Lu-Yau's Ricci curvature.

math.CA

The Ultra-Radical: Analytic Continuation, Branching, and Stability of the Principal Branch

We study the ultra-radical $\sqrt[{n;a;b}]{x}$, the multi-valued solution to $y^{a}=1+a x y^{b}$. Inside the convergence radius $|x|<R$, every branch is given by a Master-J power series; for $|x|\ge R$, analytic continuation requires switching to one of two conjugate series. We introduce a deterministic geometric criterion that selects, for each branch index $n$, the correct conjugate series, thereby eliminating heuristic search and guaranteeing branch continuity across $|x|=R$. Key finding: Only the principal branch ($n=0$) remains continuous when the parameters $a$, $b$, and $x$ vary smoothly. This includes the critical limits $a\to0$ (transition to an exponential equation) and $b\to0$ (transition to a binomial root), where the principal branch converges to the corresponding classical solution. In contrast, branches with $n\neq0$ exhibit oscillatory divergence as $a\to0$ and lose their identity in these limits. This structural continuity singles out the principal branch for applications where parameters may vary with the system's state, such as in nonlinear media with field-dependent exponents or adaptive dynamical systems.

math.CA