DDDamian Dąbrowski

Damian Dąbrowski

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Damian Dąbrowski has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On the dimension of $s$-Nikodým sets

    by Damian Dąbrowski, Max Goering, Tuomas Orponen

    Let s \in [0,1] . We show that a Borel set N \subset \mathbb{R}^{2} each of whose points is linearly accessible by an s -dimensional family of lines has Hausdorff dimension at most 2 - s . This is a sharp bound, due to a construction of A. Máthé.

  • Open Access

    On the logarithmic equilibrium measure on curves

    by Damian Dąbrowski, Tuomas Orponen

    Let $μ$ be the logarithmic equilibrium measure on a compact set $γ\subset \mathbb{R}^{d}$. We prove that $μ$ is absolutely continuous with respect to the length measure on the part of $γ$ which can be locally expressed as the graph of a $C^{1,α}$-function $\mathbb{R} \to \mathbb{R}^{d - 1}$, $α> 0$. For $d = 2$, at least in the case where $γ$ is a compact $C^{1,α}$-graph, our result can also be deduced from the classical fact that $μ$ coincides with the harmonic measure of $Ω=\mathbb{R}^{2} \, \setminus \, γ$ with pole at $\infty$. For $d \geq 3$, however, our result is new even for $C^{\infty}$-graphs. In fact, up to now it was not even known if the support of $μ$ has positive dimension.

  • Open Access

    Quantitative Besicovitch projection theorem for irregular sets of directions

    by Damian Dąbrowski

    The classical Besicovitch projection theorem states that if a planar set with finite length is purely unrectifiable, then almost all orthogonal projections of have zero length. We prove a quantitative version of this result: if is AD‐regular and there exists a set of direction with such that for every we have , then a big piece of can be covered by a Lipschitz graph with . The main novelty of our result is that the set of good directions is assumed to be merely measurable and large in measure, while previous results of this kind required to be an arc. As a corollary, we obtain a result on AD‐regular sets which avoid a large set of directions, in the sense that the set of directions they span has a large complement. It generalizes the following easy observation: a set is contained in some Lipschitz graph if and only if the complement of the set of directions spanned by contains an arc.


  • Open Access

    Favard length and quantitative rectifiability

    by Damian Dąbrowski

    The Favard length of a Borel set $E\subset\mathbb{R}^2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This gives a quantitative version of the Besicovitch projection theorem. As a corollary, we answer questions of David and Semmes and of Peres and Solomyak. We also make progress on Vitushkin's conjecture.

  • Open Access

    Structure of sets with nearly maximal Favard length

    by Alan Chang, Damian Dąbrowski, Tuomas Orponen, Michele Villa

    Let E ⊂ B(1) ⊂ ‫ޒ‬ 2 be an H 1 measurable set with H 1 (E) < ∞, and let L ⊂ ‫ޒ‬ 2 be a line segment with H 1 (L) = H 1 (E). It is not hard to see that Fav(E) ≤ Fav(L). We prove that in the case of near equality, that is, Fav(E) ≥ Fav(L)-δ, the set E can be covered by an ϵ-Lipschitz graph, up to a set of length ϵ. The dependence between ϵ and δ is polynomial: in fact, the conclusions hold with ϵ = Cδ 1/70 for an absolute constant C > 0. D ąbrowski and Orponen are supported by the Academy of Finland via the project Incidences on Fractals,


  • Open Access

    How much can heavy lines cover?

    by Damian Dąbrowski, Tuomas Orponen, Hong Wang

    One formulation of Marstrand's slicing theorem is the following. Assume that , and is a Borel set with . Then, for almost all directions , almost all of is covered by lines parallel to with . We investigate the prospects of sharpening Marstrand's result in the following sense: in a generic direction , is it true that a strictly less than ‐dimensional part of is covered by the heavy lines , namely those with ? A positive answer for ‐regular sets was previously obtained by the first author. The answer for general Borel sets turns out to be negative for and positive for . More precisely, the heavy lines can cover up to a dimensional part of in a generic direction. We also consider the part of covered by the ‐heavy lines, namely those with for . We establish a sharp answer to the question: how much can the ‐heavy lines cover in a generic direction? Finally, we identify a new class of sets called sub‐uniformly distributed sets, which generalise Ahlfors‐regular sets. Roughly speaking, these sets share the spatial uniformity of Ahlfors‐regular sets, but pose no restrictions on uniformity across different scales. We then extend and sharpen the first author's previous result on Ahlfors‐regular sets to the class of sub‐uniformly distributed sets.


  • Open Access

    How much can heavy lines cover?

    by Damian Dąbrowski, Tuomas Orponen, Hong Wang

    One formulation of Marstrand's slicing theorem is the following. Assume that $t \in (1,2]$, and $B \subset \mathbb{R}^{2}$ is a Borel set with $\mathcal{H}^{t}(B) < \infty$. Then, for almost all directions $e \in S^{1}$, $\mathcal{H}^{t}$ almost all of $B$ is covered by lines $\ell$ parallel to $e$ with $\dim_{\mathrm{H}} (B \cap \ell) = t - 1$. We investigate the prospects of sharpening Marstrand's result in the following sense: in a generic direction $e \in S^{1}$, is it true that a strictly less than $t$-dimensional part of $B$ is covered by the heavy lines $\ell \subset \mathbb{R}^{2}$, namely those with $\dim_{\mathrm{H}} (B \cap \ell) > t - 1$? A positive answer for $t$-regular sets $B \subset \mathbb{R}^{2}$ was previously obtained by the first author. The answer for general Borel sets turns out to be negative for $t \in (1,\tfrac{3}{2}]$ and positive for $t \in (\tfrac{3}{2},2]$. More precisely, the heavy lines can cover up to a $\min\{t,3 - t\}$ dimensional part of $B$ in a generic direction. We also consider the part of $B$ covered by the $s$-heavy lines, namely those with $\dim_{\mathrm{H}} (B \cap \ell) \geq s$ for $s > t - 1$. We establish a sharp answer to the question: how much can the $s$-heavy lines cover in a generic direction? Finally, we identify a new class of sets called sub-uniformly distributed sets, which generalise Ahlfors-regular sets. Roughly speaking, these sets share the spatial uniformity of Ahlfors-regular sets, but pose no restrictions on uniformity across different scales. We then extend and sharpen the first author's previous result on Ahlfors-regular sets to the class of sub-uniformly distributed sets.

  • Necessary condition for the L2 boundedness of the Riesz transform on Heisenberg groups

    by Damian Dąbrowski, Michele Villa

    Let be a Radon measure on the nth Heisenberg group . In this note we prove that if the -dimensional (Heisenberg) Riesz transform on is -bounded, and if for all Borel sets with , then must have -polynomial growth. This is the Heisenberg counterpart of a result of Guy David from [ Dav91 ].


  • Open Access

    Quantitative Besicovitch projection theorem for irregular sets of directions

    by Damian Dąbrowski

    The classical Besicovitch projection theorem states that if a planar set $E$ with finite length is purely unrectifiable, then almost all orthogonal projections of $E$ have zero length. We prove a quantitative version of this result: if $E\subset\mathbb{R}^2$ is AD-regular and there exists a set of direction $G\subset \mathbb{S}^1$ with $\mathcal{H}^1(G)\gtrsim 1$ such that for every $\theta\in G$ we have $\|\pi_\theta\mathcal{H}^1|_E\|_{L^{\infty}}\lesssim 1$, then a big piece of $E$ can be covered by a Lipschitz graph $\Gamma$ with $\mathrm{Lip}(\Gamma)\lesssim 1$. The main novelty of our result is that the set of good directions $G$ is assumed to be merely measurable and large in measure, while previous results of this kind required $G$ to be an arc. As a corollary, we obtain a result on AD-regular sets which avoid a large set of directions, in the sense that the set of directions they span has a large complement. It generalizes the following easy observation: a set $E$ is contained in some Lipschitz graph if and only if the complement of the set of directions spanned by $E$ contains an arc.