Pith. sign in

REVIEW 3 major objections 3 minor 42 references

Power Laws for the Favard Length Problem in $\mathbb{R}^d$

T0 review · 3 major / 3 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proves that the Favard length of neighbourhoods of the 2^d-corner Cantor set decays as a power law — the first nontrivial upper bound when d≥3.

desk verdict The first Favard-length power law in d≥3 is real and worth refereeing, but the proof as written has a sign error in the load-bearing contradiction and a factor-2 slip in the exponent. read the letter →

arxiv 2509.02882 v1 pith:GZ3XFZHE submitted 2025-09-02 math.CA math.MGmath.NT

Caleb Marshall This is my paper
classification math.CAmath.MGmath.NT MSC 28A7828A8011C0842B0511B75
keywords FavardlengthrationalproductCantorsetsfour-cornersetcyclotomicpolynomialsvanishingsumsofrootsunityRieszproductspurelyunrectifiablepowerlaw
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper aims to show that the Favard length—the average length of the orthogonal projections of a set onto lines in every direction—decays as a power of the scale for certain self-similar dusts in R^d, d≥2. For the 2^d-corner Cantor set this yields C^{-1}N^{-1} ≤ Fav(N_{2^{-dN}}(K_d^∞)) ≤ C N^{-ε}, the first nontrivial upper bound of this kind for d≥3. The same machinery covers rational product Cantor sets whose digit sets are small, have accumulating cyclotomic zeroes with at most two prime factors, or contain a fibered subset; the fibered case is new even in the plane. A sympathetic reader should care because the result turns the qualitative Besicovitch-Federer projection theorem into a quantitative rate and shows that the arithmetic of vanishing sums of roots of unity controls a geometric-measure-theoretic quantity.

What carries the argument

The load-bearing object is the lacunary Riesz product ∏_{k=0}^{n-1} φ_t(L^k ξ), where φ_t(ξ)=φ_{A_1}(ξ)φ_{A_2}(t_1ξ)⋯φ_{A_d}(t_{d-1}ξ) and each φ_{A_i} is the normalized mask polynomial A_i(e^{2πiξ})/#A_i. The cyclotomic factorization A_i=A_i^{(1)}A_i^{(2)}A_i^{(3)}A_i^{(4)} separates the 'accumulating zeroes' S^{(2)}_{A_i}—roots of unity coprime to #A_i—from the tame factors. The proof needs two quantitative level-set properties: the SSV property bounds the set where the product is small, and the SLV property constructs a large set Γ whose difference set lies where the product is large; the Salem trick then forces the Riesz-product integral to be large, contradicting the L^2 bound on the co

What would settle it

Find a digit set A with a fibered subset whose cardinality is strictly less than min_σ FIB(S^{(2)}_A, σ); that would disprove the paper's key combinatorial input (Proposition 2.11) and collapse Theorem 2.10. Alternatively, numerically measure Fav(N_{2^{-dN}}(K_d^∞)) for d=3 and see whether it decays like N^{-ε} rather than N^{-ε/log log N}.

Watch

Extended reading notes

Core claim

The central discovery is that the planar Buffon-needle method for the four-corner Cantor set transfers to all dimensions, provided the digit sets' mask polynomials are analyzed through their cyclotomic factorization. The paper's main theorem (Theorem 2.16) states that if each digit set A_i satisfies one of three conditions—#A_i ≤ 10, the lcm of its accumulating zeroes has at most two prime factors, or A_i admits a fibered subset—then the Favard length of the L^{-N}-neighbourhood of the rational product Cantor set S^∞ decays as N^{-ε} when all mask polynomials have only roots of unity, and as N^{-ε/log log N} otherwise. Theorem 1.2 is the special case A_i={0,2^d−1}, whose mask polynomial X^{2

Load-bearing premise

The new fibered-digit result depends entirely on an unproved-in-this-paper combinatorial estimate, taken from the author's own preprint reference [17], that any digit set containing a fibered subset must have at least a certain explicit number of digits; if that estimate is false or has a gap, the construction of large-value sets in Section 5 fails and the fibered case collapses.

Editorial extensions

If this is right

  • For the 2^d-corner Cantor set, the Favard length of the 2^{-dN}-neighbourhood is squeezed between N^{-1} and N^{-ε} for all large N, pinning the decay rate to a power law.
  • In dimensions d≥3 this is the first nontrivial asymptotic upper bound for a purely 1-unrectifiable set whose H^1 measure is not concentrated in a two-dimensional affine subspace.
  • The exponent analysis (Proposition 3.20) gives a universal, dimension-free function δ(c1,C1) describing how the power depends on the SSV and SLV constants, and it recovers an exponent 1/4 for the planar four-corner set, improving the previously stated 1/6.
  • Any digit set satisfying one of the three conditions—small cardinality, two-prime accumulating lcm, or fibered subset—yields a power law, with a log-log loss only when the mask polynomial has irrational-phase roots.
  • The fibered condition produces power laws for a family of planar rational product Cantor sets that were not covered by earlier planar theorems.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A plausible takeaway the paper does not state: the real bottleneck for power laws is not the dimension but the arithmetic inequality #A ≥ min_σ FIB(S^{(2)}_A,σ); any new class of digit sets that verifies this inequality should inherit a Favard power law by the same proof.
  • Because Proposition 3.20's exponent function is dimension-free and depends only on SSV/SLV constants, numerical experiments on the 8-corner set in R^3 could directly probe whether the attainable exponent is close to the planar 1/4 or degrades with dimension.
  • The explicit link to Vitushkin's conjecture suggests fibered digit sets could serve as tractable test cases for quantitative analytic-capacity estimates, since the same Riesz-product level sets control both quantities.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper develops a higher-dimensional version of the Nazarov–Peres–Volberg / Bond–Laba–Volberg method for upper bounds on the Favard length of small neighbourhoods of self-similar sets. It claims power-law decay for the 2^d-corner Cantor set in R^d (Theorem 1.2) and, more generally, for rational product Cantor sets whose digit sets satisfy one of three conditions: cardinality at most 10, accumulating cyclotomic divisors with at most two prime factors, or existence of a fibered subset (Theorems 2.4, 2.10, 2.16). The proof introduces a counting function, a set of low-multiplicity directions E_{N,K}, and reduces the desired Favard bound to estimating H^1(E_{N,K}). That estimate is obtained by comparing upper and lower bounds for a Riesz product over an almost-unit interval, using SSV and SLV properties. The fibered case relies on a lower bound for mask polynomials from the author's unpublished preprint [17].

Significance. If correct, the main theorem is a genuine advance: it provides the first non-trivial Favard-length upper bound for purely 1-unrectifiable sets in R^d, d≥3, whose H^1 measure is not concentrated on a two-dimensional affine subspace. The paper also introduces a useful modular framework, separating the SSV/SLV estimates from the combinatorial counting arguments, and it makes explicit the dependence of the final exponent on the SSV and SLV constants. The new fibered digit-set class is potentially interesting even in the plane. However, the proof of the central contradiction currently contains a sign error and an incorrect exponent, and the new fibered case rests on an unpublished preprint. The result is likely repairable, but the manuscript as written is not rigorous.

major comments (3)
  1. [§3.4, proof of Theorem 2.4, Eqs. (3.16)–(3.19)] The final contradiction has the sign reversed. After comparing (3.16) and (3.17), the author obtains N^{1-α√ε0} ≲ m and then chooses ε0 > 1/α², claiming that N^{α'} ≲ log N for some α'>0. But if ε0 > 1/α², then 1-α√ε0 < 0, so the left-hand side is N^{-c} with c>0, and the inequality N^{-c} ≲ m is true for all large N. A contradiction requires 1-α√ε0 > 0, i.e. ε0 < 1/α². This is not cosmetic: it is the exact step that rules out H^1(E_{N,K}) > K^{-β}, and therefore Theorems 2.4 and 2.16 are not proved as written. The argument is repairable by choosing ε0 < 1/α², but the stated proof is invalid.
  2. [§4.3, Prop. 4.5, Eq. (4.16); §3.4, Prop. 3.19, Eq. (3.18)] The explicit value of α is wrong by a factor of 2 in the SSV case. In the SSV branch of the proof of Proposition 4.5, ψ(m)=L^{-c1m}, so L^{-2C1m}ψ(m)^2 = L^{-2(C1+c1)m} = N^{-2(C1+c1)√ε0}. Therefore the correct α is 2(c1+C1), not c1+C1 as stated in (3.18) and (4.16). This error affects the allowable range of ε0 and, together with the sign error above, invalidates the quantitative characterization in Proposition 3.20 and the claimed recovery of an ε>1/4 exponent in Remark 1.3 and §3.5. The existence argument can survive after redefining α, but the quantitative claims as written are unsupported.
  3. [§2.3, Prop. 2.11; §5.2, Lemma 5.2 and Prop. 5.9] The new fibered-digit-set case is conditional on Proposition 2.11, a size estimate #A ≥ min_σ FIB(S_A^{(2)},σ) taken verbatim from the author's unpublished preprint [17]. The construction of the single-scale SLV set in Section 5.2 depends directly on this bound, including the strict inequality (5.15) used to match the λ parameters. Because [17] is not available in the manuscript and the result is not proved or even stated in sufficient detail here, the referee cannot verify the new theorem for fibered sets. This does not affect Theorem 1.2, which uses the #A_i≤10 condition, but it does mean Theorem 2.10 and the fibered part of Theorem 2.16 are not independently verifiable. Please either include a proof of Proposition 2.11 or state clearly that the result is conditional on [17] being accepted.
minor comments (3)
  1. [§2.3.1, Example 2.15] The text says 'whereas, B is an (S_A^{(2)}, σ_p)-fibered set' for the set D; this should read 'whereas D is an (S_A^{(2)}, σ_p)-fibered set'.
  2. [§3.5, proof of Proposition 3.20] The proof switches notation between C1 and C2: after defining δ(s,t) with constants c1,C1, the displayed computation uses (c1+C2)^2. This should be corrected to C1 throughout.
  3. [§3.5, after Proposition 3.20] The claimed bound Fav ≲ N^{-1/4+u} appears to have a sign error. With ρ>3 and β<1, the maximum of δ(1,0) is strictly less than 1/4, so the exponent should be of the form 1/4-u (u>0), not 1/4+u. This should be corrected or the claim removed.

Circularity Check

2 steps flagged · score 4.0 of 10

Central Favard estimates are not equivalent to their inputs, but the new fibered case leans on the author's own unpublished size bound [17] and the planar SLV foundation [22], making the independence partly borrowed.

  1. self citation load bearing [Section 5.2, proof of Proposition 5.9 (Lemma 5.2); relies on Proposition 2.11 quoted from [17]]
    "We now utilize the size bound of G. Kiss, I. Laba, G. Somlai and the author in [17] (which is Proposition 2.11 in our work), which states that (since A is assumed to contain a non-empty subset A′ which is (S, σ)-fibered and σ0 is a minimizing assignment function): #A ≥ #A′ ≥ pE1(S,σ0)1 · · ·pEK(S,σ0)K ."

    This is not a logical equivalence, but it is a load-bearing import from the authors' own unpublished preprint: the construction of the single-scale SLV set in Lemma 5.2, and hence Theorem 2.10's Favard bound for fibered digit sets, collapses if Proposition 2.11 fails. The paper does not prove the bound; it quotes it from [17], whose authors include the present author. Since the cited work is neither machine-checked nor otherwise independently verified here, the independence of the central claim is limited. It is a dependency rather than a derivation, but the self-citation is essential rather than incidental.

  2. self citation load bearing [Section 5, Lemma 5.1 (used in Proposition 3.6 and Theorem 2.4)]
    "We will use the following result, which was proven by I. Laba and author in [22]. We think of this as a single scale SLV set result."

    Lemma 5.1 supplies the single-scale SLV set for the two hypotheses #Ai≤10 and sAi with at most two prime factors; these are exactly the cases in which Theorem 2.4 obtains a power law. The lemma is taken from a prior paper co-authored by the present author. It is peer-reviewed and not the same as the d-dimensional Favard theorem, so this is not full circularity; but the d≥3 upper bound inherits the correctness of the author's planar lemma rather than proving it in this paper.

full rationale

The derivation chain for the main Favard upper bounds is not self-definitional: no parameter is fitted to the target quantity, no 'prediction' is a renamed input, and the power-law conclusions do not appear as assumptions. The 2^d-corner set result follows from Theorem 2.4 with #Ai=2≤10, which is a genuine specialization. The proof framework (counting function, SSV/SLV properties, Riesz-product estimates, combinatorial lemmas) is carried out in the paper, with the planar tools of [3] and [22] as external inputs. The main circularity concern is dependency rather than equivalence: the new fibered-digit-set case (Theorem 2.10) is explicitly built on Proposition 2.11 from the author's own unpublished preprint [17], and Lemma 5.1 from the author's prior paper [22] is load-bearing for the standard cases. These citations provide real content but are not independently verified in the present text, so the paper's independence is partial. I also flag two non-circular correctness risks, which do not raise the circularity score: the final contradiction in the proof of Theorem 2.4 appears to have a sign error (choosing ε0>1/α² makes N^{1-α√ε0}=N^{-c}, which is compatible with m≈log N; the needed condition is ε0<1/α²), and the lower bound in Lemma 5.3 claiming a factor L^{(1-η)m} for a subset of [0,1] appears impossible as written (likely a typo for L^{-(1-η)m}). These affect rigor but are not circularity. Overall, the central claim still has independent mathematical content, so a score of 4 is appropriate rather than 0 or 8.

Assumptions & free parameters 5 free parameters · 6 assumptions · 2 invented entities

The paper's central results rest on standard Fourier analysis and on several unverified-in-this-paper lemmas from prior work, especially the same-author papers [17] and [22]. The exponents and constants are existential and chosen by hand in the proof, not fitted to data. No new physical entities are introduced; the novel mathematical structure is the fibered digit set.

free parameters (5)
  • exponent ε = unspecified; lies in (0,1)
    Theorem 1.2 and 2.16 assert existence of ε but do not compute it. Proposition 3.20 gives the symbolic dependence δ(c1,C1) = 1/((c1+C1)^2 + β^{-1}ρ), not a numerical value.
  • SSV constants c1,c2,c3 = unspecified
    Lemma 3.2 from [3] supplies constants; the proof of Prop 4.1 chooses c3 ≥ 2c2 and c2 > d-1+c4, which affects the argument.
  • SLV constants C1,C2,η = unspecified
    Definition 3.5; C2 is used in Prop 4.5; the choice of η∈(0,1) must be small enough relative to ε0 to satisfy inequality (4.14).
  • parameters ρ and β = ρ>3, β∈(0,1)
    Arbitrary choices in the definition of low multiplicity directions and assumed measure bound; Proposition 3.20 makes the final exponent depend on them.
  • parameter ε0 = chosen > 1/α^2
    Chosen small but satisfying inequality in proof of Theorem 2.4; controls K and m via Definition 3.17.
assumptions (6)
  • standard math Besicovitch-Federer theorem
    Used in the introduction to guarantee existence of a decay function ψ; cited as [25, Theorem 18.1].
  • domain assumption Open set condition and self-similarity of rational product Cantor sets
    Ensures 0<H^1(S∞)<+∞ when the product of digit set sizes equals the base L; Section 2.1.
  • standard math Cyclotomic factorization and Bruijn-Redei-Schoenberg theorem
    Basis for relating digit sets to vanishing sums of roots of unity; Theorem 2.7.
  • domain assumption Size bound for fibered sets (Kiss, Laba, Marshall, Somlai [17, Prop 2.11])
    Adopted as a black box; determines the cardinality lower bound for fibered digit sets used in Lemma 5.2 and Proposition 5.9.
  • domain assumption Single-scale SLV set existence for #A≤10 or sA with ≤2 prime factors (Lemma 5.1)
    Cited from [22]; the SLV construction in Section 5 relies on it for Theorem 2.4(1)-(2).
  • domain assumption Set of small values property for φ'_{A_i} (Lemma 3.2)
    Black-boxed from [3, Section 4]; supplies the constants c1,c2,c3 needed for sublevel set estimates.
invented entities (2)
  • fibered digit sets and fibered subsets
    purpose: Hypothesis class for which a power law is proven; enables SLV construction under arbitrarily many prime factors
    New combinatorial condition introduced in Definitions 2.8 and 2.9, adapted from [17]; it has no falsifiable handle outside the paper.
  • SLV set Γ and the set of large values property
    purpose: Technical tool to force a lower bound on a Riesz product integral
    Constructed within the paper; internal to the proof.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Power Laws for the Favard Length Problem in $\mathbb{R}^d$." pith.science (2026). https://pith.science/paper/GZ3XFZHE

@misc{pith2026250902882,
  author       = {Pith},
  title        = {Pith review of: Power Laws for the Favard Length Problem in $\mathbbR^d$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GZ3XFZHE}},
  note         = {Machine review of arXiv:2509.02882}
}
abstract

We prove a power law for the asymptotic decay of the Favard length of neighbourhoods of certain self-similar sets in $\mathbb{R}^d$ with $d \geq 2$. These self-similar sets are generalizations of the so-called four-corner Cantor set to higher dimensions, as well as to a more general class of rational digit sets. When $d \geq 3$, our estimates are the first such non-trivial asymptotic upper bounds for the Favard length problem. The extension to a new class of digit sets (which is new even when $d = 2$, but holds for $d \geq 2$ generally) uses the work of G. Kiss, I. Laba, G. Somlai and the author on vanishing sums of roots of unity and divisibility by many cyclotomic polynomials.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

42 extracted references · 41 canonical work pages

  1. [17]

    G. Kiss, I. Laba, C. Marshall, G. Somlai, Lower bounds for mask polynomials with many cyclotomic divisors, preprint, (2025), arXiv:2507.11672

    work page arXiv 2025

  2. [1]

    Bateman, A

    M. Bateman, A. Volberg, An estimate from below for the Buffon needle probability of the four-corner Cantor set , Math. Res. Lett. 17 (2010), 959-967

    work page 2010

  3. [2]

    M. Bond, Combinatorial and Fourier Analytic L2 Methods For Buffon ’s Needle Problem , PhD thesis, University of Michigan, http://bondmatt.wordpress.com/2011/03/02/thesis-second-complete-draft/

    work page 2011

  4. [3]

    M. Bond, I. Laba, and A. Volberg, Buffon needle estimates for rational product Cantor sets, Amer. J. Math. 136 (2014), 357-391

    work page 2014

  5. [4]

    M. Bond, A. Volberg: Buffon needle lands in ϵ-neighborhood of a 1-dimensional Sierpinski Gasket with probability at most | log ϵ|−c, Comptes Rendus Mathematique, 348(11) (2010), 653–656

    work page 2010

  6. [5]

    M. Bond, A. Volberg: Circular Favard Length of the Four-Corner Cantor Set , J. of Geom. Anal. 21 (2011), 40–55

    work page 2011

  7. [6]

    M. Bond, A. Volberg, Buffon ’s needle landing near Besicovitch irregular self-similar sets , Indiana Univ. Math. J. 61(6) (2012), 2085–2109

    work page 2012

  8. [7]

    Bongers, Geometric bounds for Favard length , Proc

    T. Bongers, Geometric bounds for Favard length , Proc. Amer. Math. Soc. 147, (2019)

    work page 2019

Show all 42 references
  1. [8]

    Bongers, K

    T. Bongers, K. Taylor, Transversal families of nonlinear projections and generalizations of Favard length, Anal. & PDE, 16(1), (2023), 278–308

    2023

  2. [9]

    Chang, D

    A. Chang, D. D¸ abrowski, T. Orponen, M. Villa, Structure of sets with nearly maximal Favard length , Anal. & PDE, 17(4), (2024), 1473–1500

    2024

  3. [10]

    Christie, K

    L. Christie, K. Dykema, I. Klep, Classifying minimal vanishing sums of roots of unity , preprint, arXiv:2008.11268

    2008

  4. [11]

    Cladek, B

    L. Cladek, B. Davey, K. Taylor, Upper and lower bounds on the rate of decay of the Favard curve length for the four-corner Cantor set , to appear in Indiana U. Math. J. (2022)

    2022

  5. [12]

    Coppersmith, J.P

    D. Coppersmith, J.P. Steinberger: On the entry sum of cyclotomic arrays , Integers: the Electronic Journal of Combinatorial and Additive Number Theory, 6 (2006)

    2006

  6. [13]

    D¸ abrowksi,Favard length and quantitative rectifiability , preprint, arXiv:2408.03919

    D. D¸ abrowksi,Favard length and quantitative rectifiability , preprint, arXiv:2408.03919

    arXiv

  7. [14]

    D¸ abrowski, M

    D. D¸ abrowski, M. Villa, Analytic capacity and dimension of setx with plenty of big projections , Trans. Am. Math. Soc., 378(6), (2025), 2897–3950

    2025

  8. [15]

    de Bruijn, On the factorization of cyclic groups , Indag

    N.G. de Bruijn, On the factorization of cyclic groups , Indag. Math. 15 (1953), 370–377

    1953

  9. [16]

    G. Kiss, R. D. Malikiosis, G. Somlai, M. Vizer, On the discrete Fuglede and Pompeiu problems , Analysis & PDE 13 (2020), 765-788

    2020

  10. [18]

    I. Laba, Recent progress on Favard length estimates for planar Cantor sets , Appearing in: Operator- Related Function Theory and Time-Frequency Analysis, Proceedings of the 2012 Abel Symposium, K. Grochenig, Y. Lyubarskii, K. Seip, eds., Springer 2015, pp. 117-145

    2012

  11. [19]

    I. Laba, I. Londner, Combinatorial and harmonic-analytic methods for integer tilings , Forum of Math. - Pi 10 (2022), 1–46

    2022

  12. [20]

    I. Laba, K. Zhai: The Favard length of product Cantor sets, Bull. London Math. Soc. 42 (2010), 997–1009

    2010

  13. [21]

    Lam and K.H

    T.Y. Lam and K.H. Leung, On vanishing sums of roots of unity , J. Algebra 224 (2000), 91–109

    2000

  14. [22]

    I. Laba, C. Marshall, Vanishing sums of roots of unity and the Favard length of self-similar product sets , Discrete Analysis 19 (2022), 31 pp

    2022

  15. [23]

    H. B. Mann, On Linear Relations Between Roots of Unity , Mathematika 12(2) (1965), 107–117

    1965

  16. [24]

    Mattila, Orthogonal projections, Riesz capacities, and Minkowski content, Indiana Univ

    P. Mattila, Orthogonal projections, Riesz capacities, and Minkowski content, Indiana Univ. Math. J. 124 (1990), 185–198

    1990

  17. [25]

    Mattila: Geometry of Sets and Measures in Euclidean Spaces , Cambridge University Press, (1995)

    P. Mattila: Geometry of Sets and Measures in Euclidean Spaces , Cambridge University Press, (1995). POWER LA WS FOR THE F A V ARD LENGTH PROBLEM INRd 51

    1995

  18. [26]

    Mattila: Fourier Analysis and Hausdorff Dimension , Cambridge University Press, (2015)

    P. Mattila: Fourier Analysis and Hausdorff Dimension , Cambridge University Press, (2015)

    2015

  19. [27]

    Nazarov, Y

    F. Nazarov, Y. Peres, A. Volberg: The power law for the Buffon needle probability of the four-corner Cantor set, Algebra i Analiz 22 (2010), 82–97; translation in St. Petersburg Math. J. 22 (2011), 61–72

    2010

  20. [28]

    Peres, B

    Y. Peres, B. Solomyak, How likely is buffon ’s needle to fall near a planar Cantor set? , Pacific J. Math. 24 (2002), 473–496

    2002

  21. [29]

    Poonen and M

    B. Poonen and M. Rubinstein: Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Disc. Math. 11 (1998), 135–156

    1998

  22. [30]

    R´ edei,¨Uber das Kreisteilungspolynom, Acta Math

    L. R´ edei,¨Uber das Kreisteilungspolynom, Acta Math. Hungar. 5 (1954), 27–28

    1954

  23. [31]

    R´ edei,Nat¨ urliche Basen des Kreisteilungsk¨ orpers, Abh

    L. R´ edei,Nat¨ urliche Basen des Kreisteilungsk¨ orpers, Abh. Math. Sem. Univ. Hamburg 23 (1959), 180– 200

    1959

  24. [32]

    Malikiosis A linear programming approach to Fuglede’s conjecture in Z3 p, Sampl

    R.D. Malikiosis A linear programming approach to Fuglede’s conjecture in Z3 p, Sampl. Theory Signal Process. Data Anal. 22(3) (2024)

    2024

  25. [33]

    I. J. Schoenberg, A note on the cyclotomic polynomial , Mathematika 11 (1964), 131-136

    1964

  26. [34]

    J. P. Steinberger, Minimal vanishing sums of roots of unity with large coefficients , Proc. London Math. Soc. 97(3) (2008), 689–717

    2008

  27. [35]

    Taylor, Connections between fractal geometry and projections , Not

    K. Taylor, Connections between fractal geometry and projections , Not. Am. Math. Soc. 71(11) (2024), 1458—1469

    2024

  28. [36]

    Tao, A quantitative version of the Besicovitch projection theorem via multiscale analysis, Proc

    T. Tao, A quantitative version of the Besicovitch projection theorem via multiscale analysis, Proc. London Math. Soc. 98 (2009), 559–584

    2009

  29. [37]

    Tao, Exploring the toolkit of Jean Bourgain , Bull

    T. Tao, Exploring the toolkit of Jean Bourgain , Bull. Amer. Math. Soc., 58(2) (2021), 155–171

    2021

  30. [38]

    Tolsa, Analytic capacity, rectifiability, and the Cauchy integral, Proceedings of the ICM 2006, Madrid

    X. Tolsa, Analytic capacity, rectifiability, and the Cauchy integral, Proceedings of the ICM 2006, Madrid

    2006

  31. [39]

    Vardakis, A

    D. Vardakis, A. Volberg, The Buffon ’s needle problem for random planar disk-like Cantor sets , J. Math. Anal. App., 529(2) (2024)

    2024

  32. [40]

    Wilson, Sets with arbitrarily slow Favard decay , preprint, (2017), arxiv:1707.08137

    B. Wilson, Sets with arbitrarily slow Favard decay , preprint, (2017), arxiv:1707.08137

    2017 arXiv

  33. [41]

    Zhang, The exact power law for Buffon ’s needle landing near some random Cantor sets , Rev

    S. Zhang, The exact power law for Buffon ’s needle landing near some random Cantor sets , Rev. Mat. Iberoamericana 36(2) (2019), 537–548

    2019

  34. [42]

    Zygmund: Trigonometric Series, 3rd ed

    A. Zygmund: Trigonometric Series, 3rd ed. Cambridge University Press, (2003). Department of Mathematics, University of British Columbia, 1984 Mathematics Road, V ancouver, BC, Canada V6T 1Z2 Email address : cmarshall@math.ubc.ca

    2003

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.