Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

A construction of Kakeya Sets in Arbitrary Dimension

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

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

Pith's one-line read This paper constructs Kakeya sets in R^d whose δ-neighbourhood volume is at most C |log δ|^{-(d-1)}, the conjectured optimal decay.

desk verdict The higher-dimensional Perron tree construction is correct and gives the expected d−1 log-exponent; the reader's main worry about Proposition 5.4 does not land. read the letter →

arxiv 2607.14824 v2 pith:WYMKEU4D submitted 2026-07-16 math.CA math.FA

Rafael J. Fernández-Delgado , Mikael de la Salle This is my paper · ORCID
classification math.CAmath.FA MSC 28A7842B1542B25
keywords KakeyasetsPerrontreefairsubdivisionδ-tubesFouriermultipliersBesovspacesMinkowskidimensionreverseLittlewood-Paley
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 generalizes the two-dimensional Perron tree construction to every dimension d≥2, producing Kakeya sets whose δ-neighbourhood volumes decay like |log δ|^{-(d-1)}. Previous product constructions only gave |log δ|^{-1} in odd dimensions and |log δ|^{-d/2} in even dimensions, so this is a genuine improvement and matches the best bound allowed by the reverse Littlewood–Paley conjecture. The engine is a hierarchical rearrangement: a fair subdivision of the base polytope into congruent pieces, with each iteration translating whole blocks toward one point so the union shrinks while the reflected opposite cones stay disjoint. The same construction yields families of δ-tubes with pairwise disjoint translates and small union, and consequently gives new necessary conditions for L^p boundedness of radial Fourier multipliers in terms of Besov spaces with logarithmic smoothness.

What carries the argument

The fair subdivision and the affine-separation condition. A fair partition of the base Σ into N congruent pieces (images of N^{-1/(d−1)}Σ under a compact group) keeps aspect ratios from degenerating, so each pyramid conv(Σ_i,v) contains a δ-tube of width comparable to N^{-1/(d−1)}. Condition (3) says each piece lies in a homothetic copy of Σ centered at a distinguished point x_i; translating the piece toward o then keeps it inside a shrinking copy of Σ. Affine separation of the pairs (Σ_i,x_i) ensures the reflected cones Cone^-(Σ_i,v) have disjoint interiors after translation, which is what makes the tubes' translates disjoint in Theorem 1.4.

What would settle it

Take a specific fair subdivision that does not satisfy the corner-containment condition (3), for instance a barycentric subdivision, which lacks bounded aspect ratios, and compute the volume of the union of the translated pyramids after n iterations; finding it grows faster than n^{-(d-1)} would show the hypothesis is essential. Alternatively, exhibit a fair subdivision whose reflected cones overlap after the prescribed translations, which would destroy the disjointness in Theorem 1.4.

Watch

Extended reading notes

Core claim

For every d≥2 there exists a Kakeya set E⊂R^d and a constant C such that for every δ∈(0,1), |N_δ(E)| ≤ C |log δ|^{-(d-1)}. The construction is an iterated Perron tree: starting from a (d−1)-dimensional polytope with a fair subdivision satisfying a corner-containment condition and an affine-separation property, one translates the pyramids conv(Σ_i,v) toward a point o in the base so that after n iterations the union has volume O(n^{-(d-1)}). The bound is conjecturally optimal, as the reverse Littlewood–Paley conjecture would imply a matching lower bound. The paper also proves a tube-disjointness version (Theorem 1.4) and derives that radial Fourier multipliers that are L^p-bounded force the fu

Load-bearing premise

The construction depends on partitioning the base polytope into congruent pieces that can all be pushed toward one point while staying inside a shrinking copy of the whole, with reflected cones that never overlap; if such a partition is unavailable, the volume bound n^{-(d-1)} and the disjointness of tubes both fail.

Editorial extensions

If this is right

  • There exist Kakeya sets in R^d whose δ-neighbourhood volume is at most C|log δ|^{-(d-1)}, improving on all previously known explicit constructions for d≥3.
  • For every α>0, there are δ-tubes whose α-translates are pairwise disjoint yet whose union volume is at most C_{d,α}|log δ|^{-(d-1)} times the sum of the tube volumes.
  • Any radial Fourier multiplier bounded on L^p(R^d) must have symbol satisfying Besov regularity B^{0,(d-1)|1/p-1/2|}_{∞,∞} in logarithmic scale; in particular, logarithmic Bochner–Riesz multipliers with exponent below (d−1)|1/p−1/2| are unbounded.
  • Improving the exponent (d−1) in Theorem 1.4 would yield stronger necessary conditions for logarithmic Bochner–Riesz multipliers and would have further consequences for noncommutative L^p approximation properties.
  • The construction works for any fair polytopal partition satisfying the two geometric hypotheses; the dyadic cube and the Coxeter–Freudenthal–Kuhn simplex subdivision are concrete instances.

Reading between the lines

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

  • Editorial inference: the construction should extend to any self-similar tiling whose cells are congruent to a scaled copy of the base and whose corner structure permits affine separation; testing other Coxeter-type tessellations could reveal which polytopes yield the same exponent.
  • Editorial inference: the disjointness of reflected cones is stronger than needed for the volume bound; a quantitative version measuring how often cones overlap might yield bounds for Kakeya maximal operators rather than just for a single set.
  • Editorial inference: if the conjectured lower bound holds, these Kakeya sets are exactly as thin as possible, so the obstruction to proving the Kakeya conjecture is not the existence of very thin sets but the L^p behavior of maximal operators; this reframes where the difficulty lies.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper constructs, for every d≥2, a Kakeya set E⊂R^d whose δ-neighbourhood has volume O(|log δ|^{-(d-1)}), improving on the product constructions that gave |log δ|^{-1} in odd dimensions and |log δ|^{-d/2} in even dimensions. The construction is a higher-dimensional analogue of the Perron tree: starting from a (d−1)-polytope Σ with a fair subdivision satisfying a homothety-containment condition (3) and an affine-separation property, the authors iteratively translate pyramids toward a chosen point o and obtain an n-level tree of volume O(n^{-(d-1)}). They verify the required geometric hypotheses for the dyadic cube (Example 3.2) and for the Coxeter–Freudenthal–Kuhn simplicial subdivision (Proposition B.1). By inserting δ-tubes into the cells (Lemma 2.4), they prove a version with pairwise disjoint α-translates (Theorem 1.4), and by a patching argument (Proposition 5.4) they convert the scale-wise Kakeya sets into a single Kakeya set with the stated bound (Theorem 1.3). Section 6 uses Theorem 1.4, through an external result of de la Salle, to derive Besov-regularity conclusions for radial Fourier multipliers (Corollary 1.5).

Significance. If correct, this is the first quantitative improvement over Cartesian-product Kakeya sets in arbitrary dimension, and the exponent (d−1) is the conjecturally optimal logarithmic decay. The proof is self-contained and elementary, and it introduces a clean general framework—fair subdivisions plus affine separation—that may be of independent use. The explicit verification for the cube and the CFK simplex, together with the accompanying Jupyter notebook, are valuable. I also examined the concern raised in the review about Proposition 5.4: it does not appear to land. With δ_n=2^{-2^n}, one has δ_n/ε_n = √(d−1)δ_{n−1}/(1−δ_{n−1}) ≤ 2√(d−1)δ_{n−1}=O(√δ_n), and the final estimate uses only the monotonicity of f, not any slow-variation assumption. Thus the patching argument is consistent for arbitrary non-decreasing f. The remaining issues are expositional and local, not correctness risks.

major comments (3)
  1. [§4.1, Proposition 4.1] The induction step applies the induction hypothesis to the (n−1)-iterated partition of a first-level cell Σ_{i_n}, but the affine-separation hypothesis is stated only for the original family (Σ_i,x_i). The proof does not justify that affine separation is inherited by the iterated partitions under the affine maps defining them. This is needed in (ii) for the case i_n≠j_n, and hence for the disjointness conclusion in Theorem 4.2. The fix is short—if φ separates Σ_p and Σ_q, then φ∘A_i^{-1} separates A_i(Σ_p) and A_i(Σ_q) for the affine map A_i defining Σ_{i_n}—but it should be stated explicitly. As written, the induction is incomplete at this point.
  2. [§2, Lemma 2.5] Lemma 2.5 is a key geometric input for Lemma 5.3, where it converts the Perron-tree volume bound into a Kakeya set containing unit segments in an open set of directions. The proof is dismissed with “proven in an analogous way” and no details. The uniformity of the constant C_{Σ,v} over all fair partitions is not entirely immediate and should be written out. This is a completeness gap, not an apparent correctness issue, but it needs to be filled for the proof of Theorem 1.3 to be self-contained.
  3. [§5.1, proof of Theorem 1.4] The proof uses the asserted scaling property f_d^α(δ) ≤ (δ'/δ)^{d−1} f_d^α(δ') for 0<δ≤δ' with no proof or reference. This is used to pass from the dyadic sequence δ_n to arbitrary δ. The property is true and easy to justify by subdividing each δ'-tube into (δ'/δ)^{d−1} δ-tubes, whose α-translates lie inside the original α-translates. Please add the argument or a reference, since the assertion is otherwise unsupported.
minor comments (4)
  1. [Theorems 1.3 and 5.4] The notation “4√δ” (e.g. \(C_d 4\sqrt{\delta}\)) is ambiguous. From the proof in §5.2 it should be the fourth root \(\sqrt[4]{\delta}\), not \(4\sqrt{\delta}\). Please use unambiguous notation throughout.
  2. [§5.2, Lemma 5.3] The apex notation “v=(0,1)” should be \(v=(0,\dots,0,1)\in\mathbb{R}^d\), and the homothety notation “\(C\operatorname{conv}(\Sigma_i,v)\)” should specify the center (presumably \(v\)) to avoid ambiguity.
  3. [§5.2, after Lemma 5.3] The set \(G_{2^{-n}}\) constructed as a finite union of translates of open neighborhoods is open, while Kakeya sets are defined as compact. Taking closures preserves the volume bound and the property of containing the required segments; the text should say this explicitly.
  4. [§5.2, Proposition 5.4] The threshold \(n\ge 1+\log_2\log_2(1+\sqrt{d-1})\) is stated without explanation of where it comes from and without tracking the dimension constants. The phrase “for an appropriate value of \(C_d\)” is vague; a brief sentence explaining how finitely many small \(n\) are absorbed would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Kakeya construction is self-contained; the only self-citation [dlS26] supports the multiplier application and is not an input to Theorem 1.3.

full rationale

The core derivation chain is self-contained. Condition (3), Lemma 3.5, Lemma 3.6, Lemma 3.7, Lemma 3.8, and Proposition 3.9 establish the base case purely from convex geometry and the stated containment condition on the partition. Proposition 4.1 iterates this base case by induction, and the volume bound in Theorem 4.2 follows from the explicit choice t_i = 1/(n-i+(1-c)^{-1}) together with the identity P_m = t_1/t_{m+1} and a Hölder optimization; no fitted parameter or target quantity is reused as an input. The required fair partitions are constructed explicitly for the dyadic cube (Example 3.2) and for the Coxeter-Freudenthal-Kuhn simplex subdivision with q >= d (Proposition B.1), and the affine-separation property is proved directly. Lemma 5.3 and Proposition 5.4 convert the iterated Perron tree into a Kakeya set via a classical patching argument; even if the breadth of Proposition 5.4 were debated, that would be a correctness/robustness issue, not circularity. The one self-citation, [dlS26], is used only in Section 6 to pass from the new Kakeya/tube-volume estimate f_d(delta) <= |log delta|^{-(d-1)} to Besov-space consequences for radial Fourier multipliers; it does not enter the proof of Theorem 1.3 or Theorem 1.4, and the Kakeya estimate is not assumed by that external theorem. Lemma 2.5 is stated with only a sketch, but it is a direct geometric containment fact and is not a renamed form of the conclusion. Overall, no load-bearing step reduces by construction or by self-citation to its own input.

Assumptions & free parameters 1 free parameters · 6 assumptions · 0 invented entities

The central construction relies on standard convex geometry and on explicitly constructed fair subdivisions. The only hand-chosen free parameter is the translation schedule t_i, which is optimized in the proof rather than fitted to external data. No new particles, forces, or unexplained objects are introduced. The multiplier applications import [dlS26] as a black box, but the Kakeya construction itself does not depend on that work.

free parameters (1)
  • translation schedule t_i = t_i = 1/(n-i+(1-c)^{-1})
    Chosen by hand in Theorem 4.2 to optimize the volume bound; not fitted to data, but a free choice in the construction.
assumptions (6)
  • standard math Existence of fair subdivisions of simplices (Coxeter-Freudenthal-Kuhn)
    Invoked as Theorem 2.3 and constructed in Appendix B; needed so every iterated cell is a scaled isometric copy of the base polytope.
  • standard math Compact subgroups of GL(V) preserve a Euclidean structure
    Used after Definition 2.2 to reduce fair subdivisions to O(V)-fairness.
  • standard math Hahn-Banach separation of convex sets
    Used in Remark 3.1 and Lemma 3.8 to prove affine separation and disjointness of reflected cones.
  • domain assumption Dyadic cube and CFK simplex partitions satisfy condition (3) and affine separation uniformly
    Proved in Example 3.2 and Proposition B.1; this is the load-bearing geometric input that keeps constants uniform in the iteration.
  • domain assumption Keich's bound sup_h |T^2_{n,h}| < 1/n
    Used only in Remark 4.4 as an alternative proof of the cube case; not needed for the main theorems.
  • domain assumption [dlS26] Theorems 6.2 and 6.4 relating f_d(δ) to Fourier and Schur multiplier bounds
    Used to derive Corollary 1.5 and the Schur multiplier consequence from Theorem 1.4; accepted as prior work.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A construction of Kakeya Sets in Arbitrary Dimension." pith.science (2026). https://pith.science/paper/WYMKEU4D

@misc{pith2026260714824,
  author       = {Pith},
  title        = {Pith review of: A construction of Kakeya Sets in Arbitrary Dimension},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WYMKEU4D}},
  note         = {Machine review of arXiv:2607.14824}
}
abstract

We construct Kakeya sets in arbitrary dimension $d\geq 2$, generalizing the classical Perron tree construction beyond dimension $2$. The Kakeya sets we construct have $\delta$-neighbourhood of volume at most $C|\log\delta|^{-(d-1)}$, which improves on previously known constructions, and which is conjecturally optimal. We further derive consequences for the $L^p$-boundedness of radial Fourier multipliers in terms of Besov spaces with logarithmic smoothness.

Figures

Figures reproduced from arXiv: 2607.14824 by the authors.

Figure 1
Figure 1. Illustration of the proof of Theorem 1.4 for d = 3. The first image shows the tubes translated as a block within their respective pyramid during the 2-iterations simplex Perron tree construction. The second includes the reflected pyramids across their respective apexes, which by construction contain the −→Ri α’s. Using the results of the second-named author [dlS26], we obtain the following consequence, which was our… view at source ↗
Figure 2
Figure 2. Construction of a Perron tree via dividing a triangle into 2n sub￾triangles and recombining them with partial overlaps. Cases n = 3 is illustrated. Triangles with the same colour are those to which the basic construction is applied in each step. The branches formed at each iteration are moved as a block along with the triangular cores from which they sprout. The basic subdivision happens in the base. And the idea at… view at source ↗
Figure 3
Figure 3. n-th iterated 3D Perron tree construction starting from a simplex, and different values of n. All this goes in the correct direction, but it not enough to deduce Theorem 1.3 and Theorem 1.4. In order to do so, we will need more properties of the partition (Σi)i∈I that we start with. An additional sufficient property is that of a fair partition, where all the pieces are congruent (by an isometry, or more generally a … view at source ↗
Figures from the paper (16 more)
Figure 4
Figure 4. Figure 4: Two different fair subdivisions of the 2-simplex with q = 3. If we start with a fair subdivision and iterate it by choosing the identification of each piece of the partition with Σ according to the compact group G, there are potentially many choices involved, but for e…
Figure 5
Figure 5. Figure 5: below. Combined with the Perron tree construction we just described, this will lead to Theorem 1.3 [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]
Figure 6
Figure 6. Figure 6: Illustrating the proof of Lemma 2.4 when d = 2. The following lemma is proven in an analogous way to the previous one and will be a crucial ingredient in the proof of Theorem 1.3: Lemma 2.5. Let Σ be a (d − 1)-polytope and v ∈/ Aff(Σ). There exists a C = CΣ,v > 0 such …
Figure 7
Figure 7. Figure 7: Lemma 3.5 for a 2-simplex and o its barycenter. The previous lemma motivates the introduction of a scaled down version of T that we call the core: C(t) = H1−t o [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: Lemma 3.5 for a 3-simplex and o its barycenter. Lemma 3.6. We have that for t ∈ (0, 1 − c]: (Ti + tui) \ C(t) ⊂ H t 1−c v (Ti) + tui . Proof. We have Ti + tui = [ λ∈[0,1] [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: Lemma 3.6 for a 2-simplex and o its basis’ barycenter. The coloured pyramids are the pyramids Ti+tui for increasing values of t, and the yellow section represents the height at which the pyramids are no longer completely contained in the core. The next two lemmas descr…
Figure 10
Figure 10. Figure 10: Lemmas 3.7 and 3.8 for a 2-simplex with fair subdivision into 9 cells with o its basis’ barycenter. The upper pyramids are the reflections of the lower ones (the Ti ’s) across their respective apexes. C(t) and its opposite cone are shown as black wire frames. Lemma 3.…
Figure 11
Figure 11. Figure 11: First iteration: The first image shows a fair partition of a 2-simplex into 81 cells, which were obtained by applying a fair decomposition to the original simplex, and then successively to each of the sub cells formed after the first par￾tition. Image two shows how we…
Figure 12
Figure 12. Figure 12: Second iteration: In the last figure of 11, we see that we are left with 9 Perron trees, whose bases are all congruent to a separated scaled-down version of the fair simplicial decomposition of 9 cells. In the first image above, we have translated towards the barycent…
Figure 13
Figure 13. Figure 13: Reflection of the pyramids in the construction for different values of t2 ∈ (0, 1/3], where the respective t2 is that of the figure in 12 immediately right above. Notice how all the opposite cones have disjoint pairwise interiors, and how the two-level iteration gives…
Figure 14
Figure 14. Figure 14: n-th iterated Perron tree construction for d = 3, Σ the unit cube, and different values of n. Remark 4.5. The O(n 1−d ) asymptotic obtained is the best one can do if one employs equation (5) to bound the our Perron tree construction volume above. Indeed, by H¨older’s …
Figure 15
Figure 15. Figure 15: Illustration of the proof of Theorem 1.4 for d = 3. The first image shows the tubes translated as a block within their respective pyramid during the 2-iterations Perron tree construction of the cube. The second image includes the reflected pyramids across their respec…
Figure 16
Figure 16. Figure 16: Fair polytopal subdivision of a trapezium into 9 cells. Each star, corresponding to its same-coloured cell, represents an arbitrary choice of (xi)i∈[9] that is consistent with the rules of Remark A.3. The first picture’s choice makes it impossible for (Σi , xi) to be …
Figure 17
Figure 17. Figure 17: Fair simplicial subdivision of a triangle into 9 cells. Each star, corre￾sponding to its same-coloured cell, represents an arbitrary choice of (xi)i∈[9] that is consistent with the rules of Remark A.3. The only allowed xi ’s for the red, dark-green and indigo cells ar…
Figure 18
Figure 18. Figure 18: Plot of the fair simplicial subdivisions of R3,3 and R4,3 described in this section, together with the wire frames for their respective corner pieces. The labelling of each cell has been made explicit in R3,3, with τ = (1, 2). Let Dk = wk − wk−1. Since w is non-decrea…
Figure 19
Figure 19. Figure 19: Plot of the fair simplicial subdivisions of R3,2 and R4,3 described in this section, together with the wire frames for their respective corner pieces for c = q−1 q . The highlighted cell is not contained in any corner piece, which illustrates the necessity of the cond…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Study on Kakeya Needle Problem for $(n-1)$-Rectifiable Set

    math.CA 2026-08 conditional novelty 7.0 of 10

    Every (n-1)-rectifiable set of finite H^{n-1} measure is Kakeya-movable under orientation-preserving isometries, and associated Nikodym-type null sets exist in all dimensions.

Reference graph

Works this paper leans on

21 extracted references · 2 canonical work pages · cited by 1 Pith paper

  1. [1]

    Anthony Carbery , year=. A. 1507.02515 , archivePrefix=

    arXiv

  2. [2]

    https://mathoverflow.net/q/491104 , URL =

    Good Besicovich/Kakeya sets in high dimension , AUTHOR =. https://mathoverflow.net/q/491104 , URL =

  3. [3]

    H. S. M. Coxeter , journal =. Discrete Groups Generated by Reflections , urldate =

  4. [4]

    de Laat, Tim and de la Salle, Mikael , TITLE =. J. Reine Angew. Math. , FJOURNAL =. 2018 , PAGES =. doi:10.1515/crelle-2015-0043 , URL =

    work page doi:10.1515/crelle-2015-0043 2018

  5. [5]

    Duke Math

    Lafforgue, Vincent and de la Salle, Mikael , TITLE =. Duke Math. J. , FJOURNAL =. 2011 , NUMBER =. doi:10.1215/00127094-1443478 , URL =

    doi:10.1215/00127094-1443478 2011

  6. [6]

    Kakeya conjecture and High-Rank Lattice von

    Mikael de la Salle , year=. Kakeya conjecture and High-Rank Lattice von. 2602.14623 , archivePrefix=

    arXiv

  7. [7]

    Differentiation of integrals in ^n , publisher=

    Miguel de Guzmán , year=. Differentiation of integrals in ^n , publisher=

  8. [8]

    The Bulletin of the London Mathematical Society , volume=

    Uri Keich , year=. The Bulletin of the London Mathematical Society , volume=

Show all 21 references
  1. [9]

    Sperner's colorings, hypergraph labeling problems and fair division , series=

    Maryam Mirzakhani and Jan Vondrák , year=. Sperner's colorings, hypergraph labeling problems and fair division , series=

  2. [10]

    Remarks on

    Jean Bourgain , year=. Remarks on. Geometric Aspects of Functional Analysis , publisher=

  3. [11]

    The multiplier problem for the ball , journal=

    Charles Fefferman , year=. The multiplier problem for the ball , journal=

  4. [12]

    Isaac Jacob Schoenberg , year=. On the

  5. [13]

    Volume estimates for unions of convex sets, and the

    Hong Wang and Joshua Zahl , year=. Volume estimates for unions of convex sets, and the

  6. [14]

    Recent work connected with the

    Thomas Hartwig Wolff , year=. Recent work connected with the. Lectures on Harmonic Analysis , publisher=

  7. [15]

    Some remarks on the

    Roy Osborne Davies , year=. Some remarks on the. Mathematical Proceedings of the Cambridge Philosophical Society , volume=

  8. [16]

    2021 , MONTH = Jun, DOI =

    Boissonnat, Jean-Daniel and Kachanovich, Siargey and Wintraecken, Mathijs , URL =. 2021 , MONTH = Jun, DOI =

    2021

  9. [17]

    Antonio Cordoba , year=. The. American Journal of Mathematics , volume=

  10. [18]

    Grayson , year=

    Herbert Edelsbrunner and Daniel R. Grayson , year=. Edgewise subdivision of a simplex , journal=

  11. [19]

    Simplicial mesh generation with applications , abstract=

    Douglas William Moore , year=. Simplicial mesh generation with applications , abstract=

  12. [20]

    Simplizialzerlegungen von

    Hans Freudenthal , journal =. Simplizialzerlegungen von

  13. [21]

    A note on spherical summation multipliers

    Charles Fefferman. A note on spherical summation multipliers. Israel Journal of Mathematics. 1973. doi:10.1007/BF02771772

    1973 doi

Pith tools

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