Searcharxiv⌕ Search

arXiv · 0707.0077

Finite Sections of Weighted Carleman's Inequality

Abstract

We study finite sections of weighted Carleman's inequality following the approach of De Bruijn. Similar to the unweighted case, we obtain an asymptotic expression for the optimal constant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Gao. 2007-06-30. Finite Sections of Weighted Carleman's Inequality. https://arxiv.org/abs/0707.0077

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

KEEP EXPLORING

Related papers

Compactness of bilinear singular integral with mild kernel regularity

We establish a compact bilinear $T1$ theorem for Calderón-Zygmund operators with mild kernel regularity. The exponent obtained here matches the best-known threshold in the sufficient condition for the classical bilinear $T1$ theorem. We also introduce an equivalent unified testing condition WCP$^{*}$.

math.CA↗

Semialgebraic ${C^m}$ solutions to a univariate system of linear inequalities with Nash forcing

Let $(A_{ij}(x))_{1 \leq i \leq N, 1 \leq j \leq M}$ be a matrix of univariate semialgebraic functions. We study the solvability of the system of linear inequalities \begin{equation*} \sum_{j=1}^M A_{ij}(x)F_j(x)\leq f_i(x) \ \ \text{ for } i = 1, \ldots, N, \end{equation*} where we assume each forcing $f_i$ is a Nash function. We show that the $C^m$ solvability of the system can be characterized by finitely many linear ordinary differential inequalities in $f$ with semialgebraic coefficients depending only on $(A_{ij})$. When the system is solvable, the solution may be chosen semialgebraic, and the proof gives a constructive procedure in the semialgebraic sense. We also study the semimodule structure of admissible forcings, establishing finite generation and lack thereof in various settings.

math.CA↗

Nearly Sharp Uniform Projection Bounds and Superlinear Vitushkin Inequalities for Deterministic Self-Similar Sets

For each $α\in(0,1)$, we construct an explicit deterministic finite homogeneous planar iterated function system of similarities satisfying the strong separation condition, whose attractor $E_α$ has positive finite one-dimensional Hausdorff measure and, for all sufficiently small $δ>0$, satisfies $\sup_{0\leθ<π}H^1(π_θ(N_δ(E_α)))\lesssim_α(\logδ^{-1})^{-α}$. The defining system depends only on $α$ and is fixed at every scale. For these same sets, we prove the sharp analytic capacity law $γ(N_δ(E_α))\asymp_α(\logδ^{-1})^{-1/2}$ as $δ\rightarrow0$. Consequently, each $E_α$ satisfies the quantitative Vitushkin comparison $\operatorname{Fav}(N_δ(E_α))\lesssim_αγ(N_δ(E_α))^{2α}$ for every $δ\in(0,1)$. These comparisons are superlinear for $α>1/2$, with exponents arbitrarily close to the optimal upper limit two for this class of self-similar sets. A completely specified sixteen-map system gives $α=53/100$ and comparison exponent $53/50$. Inspired by Falconer's Venetian blind constructions, the projection argument combines exact collinear cylinder subfamilies, quantitative distribution of word orientations, and a cover indexed by first successful symbolic blocks. The rotation parameters are explicit powers of a real algebraic number, linking the construction to simultaneous Diophantine approximation. The capacity estimate follows from the curvature characterization of analytic capacity and a telescoping inequality for cylinder masses.

math.CA↗