pith. sign in

arxiv: 2604.06964 · v1 · submitted 2026-04-08 · 🧮 math.FA

Carleson families of cubes related to porous sets

Andrei V. Vasin This is my paper

Pith reviewed 2026-05-10 17:30 UTC · model grok-4.3

classification 🧮 math.FA
keywords porous setsdyadic latticesCarleson packing conditionsparseness propertydyadic coversinverse problemsEuclidean spaces
0
0 comments X

The pith

Porous sets refine the Carleson packing condition and sparseness property for their dyadic covers, and admit a converse characterization by Carleson families.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that when E is a porous subset of Euclidean space, the dyadic cubes that intersect E satisfy a strengthened form of the Carleson packing condition that depends on the porosity constant of E. It likewise obtains a sharpened sparseness property for the same collection of cubes. The work then turns to the inverse question: given a Carleson family S of dyadic cubes, when does there exist a porous set E such that S sits inside the dyadic cover of E and in fact generates that cover. These statements matter because Carleson conditions govern the size of measures that arise in harmonic analysis, while porous sets appear whenever one needs uniform gaps at every scale.

Core claim

Given a porous set E in R^d and a dyadic lattice D, the dyadic cover D_E consisting of all cubes in D that meet E obeys a refined Carleson packing condition and an improved sparseness property that incorporate the porosity constant of E. The paper studies the inverse problem of determining when a Carleson family S subset D generates a porous set E satisfying S subset D_E.

What carries the argument

The dyadic cover D_E of the porous set E, which collects every dyadic cube intersecting E and carries the refined Carleson packing bound and sparseness property.

If this is right

  • Porous sets admit dyadic covers that obey a Carleson packing bound scaled by their porosity constant.
  • The sparseness property for the dyadic cover of a porous set is strictly stronger than the corresponding property for arbitrary sets.
  • Carleson families of cubes can be used to construct or characterize porous sets via the inverse problem.
  • The refinements hold uniformly across all scales once the porosity constant is fixed.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The inverse construction supplies a method for building families of porous sets whose Carleson constants are prescribed in advance.
  • The refined conditions may be combined with standard dyadic techniques to obtain sharper control on measures supported on porous sets.
  • The results suggest a dyadic test for porosity that checks whether the packing and sparseness properties of the cover satisfy the stated refinements.

Load-bearing premise

The set E is porous, so that a fixed positive constant controls the size of the gaps that appear inside every ball centered on E.

What would settle it

A porous set E together with a dyadic lattice D whose dyadic cover D_E violates the claimed refined Carleson packing bound would falsify the refinement.

read the original abstract

Given a porous set $E\in \mathbb{R}^d$ and a dyadic lattice $\mathcal{D}$, we refine the Carleson packing condition and the sparseness property for the dyadic cover $\mathcal{D}_E=\{Q \in \mathcal{D}: \: Q \cap E \neq \varnothing\}$. We study the inverse problem, when a Carleson family $\mathcal{S} \subset \mathcal{D}$ generates the porous set $E$ such that $\mathcal{S} \subset \mathcal{D}_E$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper refines the Carleson packing condition and the sparseness property for the dyadic cover D_E = {Q in D : Q cap E ≠ ∅} when E is a porous set in R^d and D is a fixed dyadic lattice. It then studies the inverse problem: given a Carleson family S subset D that generates a porous set E with S subset D_E.

Significance. If the refinements and inverse construction hold, the results strengthen the connection between porosity and Carleson-type conditions on dyadic cubes, offering sharper control on packing and sparseness constants that could improve applications in harmonic analysis, such as weighted inequalities or singular integrals on sets of positive measure.

minor comments (3)
  1. §2, Definition 2.3: the refined sparseness constant is stated without an explicit dependence on the porosity parameter; adding a short remark on how the constant scales with the porosity radius would clarify the quantitative aspect.
  2. Theorem 3.2: the inverse construction produces E from S, but the proof sketch does not address whether the generated E is always porous with the same constants as the input family; a one-sentence clarification would strengthen the statement.
  3. Notation: the symbol D_E is used both for the cover and for the generated set in the inverse problem; a brief distinction in the introduction would prevent reader confusion.

Simulated Author's Rebuttal

0 responses · 1 unresolved

We thank the referee for reviewing our manuscript and for the positive summary and recommendation of minor revision. The description accurately captures the refinements to the Carleson packing condition and sparseness for dyadic covers of porous sets, as well as the inverse generation problem.

standing simulated objections not resolved
  • The referee recommends minor revision but lists no specific major comments, suggested changes, or issues to address, making it impossible to determine what revisions (if any) are required.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The abstract and reader's summary describe refinements to standard Carleson packing/sparseness conditions for the dyadic cover D_E of a porous set E, plus an inverse construction from Carleson families S subset D_E. No equations, fitted parameters, self-citations, or derivation steps are exhibited that reduce by construction to the inputs. The setup uses external notions (porosity, dyadic lattices) and standard techniques; the inverse problem is posed as well-posed without internal reduction to self-definition or fitted predictions. This is the typical non-circular case for such descriptive papers.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The abstract supplies only the high-level setup with no explicit free parameters, invented entities, or detailed axioms beyond the problem statement.

axioms (2)
  • domain assumption E is a porous set in R^d.
    Stated directly as the given object in the problem setup.
  • domain assumption D is a dyadic lattice.
    Standard background structure used to define the dyadic cover D_E.

pith-pipeline@v0.9.0 · 5373 in / 1241 out tokens · 81340 ms · 2026-05-10T17:30:51.347676+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

  1. [1]

    J.Weak embedding property, inner functions and en- tropy,Math

    Borichev, A., Nicolau, A., Thomas, P. J.Weak embedding property, inner functions and en- tropy,Math. Ann. 368(3)(2017), 987–1015

    work page 2017

  2. [2]

    V.MuccenhouptAp- properties of distance functions and applications to Hardy-Sobolev-type inequalities, Potent

    Dyda, B., Ihnatsyeva, L., Lehrb¨ ack, J., Tuominen, H., V¨ ah¨ akangas, A. V.MuccenhouptAp- properties of distance functions and applications to Hardy-Sobolev-type inequalities, Potent. Anal. 50 (2019), 83–105

    work page 2019

  3. [3]

    M.Free interpolation sets for H¨ older classes, Math

    Dyn’kin, E. M.Free interpolation sets for H¨ older classes, Math. USSR Sb. 37 (1980), 97–117

    work page 1980

  4. [4]

    V.Characterization of traces of smooth functions on Ahlfors regular sets, J

    Ihnatsyeva, L., V¨ ah¨ akangas, A. V.Characterization of traces of smooth functions on Ahlfors regular sets, J. Funct. Anal. 265 (2013), 1870–1915

    work page 2013

  5. [5]

    17 (2024), no

    Ivrii, O., Nicolau, A.Beurling–Carleson sets, inner function and a semilinear equation, Anal- ysis and PDE. 17 (2024), no. 7, 2585–2618

    work page 2024

  6. [6]

    Lehrb¨ ack, J., Tuominen, H.A note on the dimensions of Assouad and Aikawa, J. Math. Soc. Japan, 65 (2013), 343–356

    work page 2013

  7. [7]

    K., Nazarov, F.Intuitive dyadic calculus: The basics, Expo

    Lerner, A. K., Nazarov, F.Intuitive dyadic calculus: The basics, Expo. Math. 37 (2019), no. 3, 225–265

    work page 2019

  8. [8]

    Mattila, P

    P. Mattila, P. Saaranen.Ahlfors-David regular sets and bilipschitz maps. Ann. Acad. Sci. Fenn. Math. 34 (2009), no. 2, 487–502

    work page 2009

  9. [9]

    Wavelets: Calder´ on–Zygmund and multilinear operators

    Meyer, Y., Coifman, R. Wavelets: Calder´ on–Zygmund and multilinear operators. Cambridge Studies in Advanced Mathematics, v. 48, Cambridge, 1997

    work page 1997

  10. [10]

    V.On characterization of weakly porous sets via dyadic coverings, J

    Vasin, A. V.On characterization of weakly porous sets via dyadic coverings, J. Anal. Math. 157 (2025), 789–802. CARLESON F AMILIES OF CUBES RELATED TO POROUS SETS 13

    work page 2025

  11. [11]

    E.Imbedding and multiplier theorems for discrete Littlewood-Paley spaces

    Verbitsky, I. E.Imbedding and multiplier theorems for discrete Littlewood-Paley spaces. Pacific J. Math. 176 (1996), 2, 529–556. Admiral Makarov State University of Maritime and Inland Shipping, Dvinskaya st. 5/7, St. Petersburg 198035, Russia Email address:andrejvasin@gmail.com

    work page 1996