Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.07943

Optimization algorithms for Carleson and sparse collections of sets

Eline A. Honig·Emiel Lorist
View original source ↗Read source document ↗Export metadata ↓

Abstract

Carleson and sparse collections of sets play a central role in dyadic harmonic analysis. We employ methods from optimization theory to study such collections. First, we present a strongly polynomial algorithm to compute the Carleson constant of a collection of sets, improving on the recent approximation algorithm of Rey. Our algorithm is based on submodular function minimization. Second, we provide an algorithm showing that any Carleson collection is sparse, achieving optimal dependence of the respective constants and thus providing a constructive proof of a result of H\"anninen. Our key insight is a reformulation of the duality between the Carleson condition and sparseness in terms of the duality between the maximum flow and the minimum cut in a weighted directed graph.

Explore related subjects

math.CAmath.CO

Keep this discovery

BibTeXRIS

Eline A. Honig, Emiel Lorist. 2025-01-14. Optimization algorithms for Carleson and sparse collections of sets. https://doi.org/10.1016/j.acha.2026.101891

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

KEEP EXPLORING

Related papers

arXiv2026

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA↗
arXiv2026

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA↗
arXiv2026

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA↗