Pith. sign in

REVIEW 3 major objections 5 minor 36 references

Rational Points and Brownian Motion

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

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

Pith's one-line read The paper proves that, for almost every Brownian path, rational points near its graph follow an explicit Q^{5/2} counting law whenever the tube thickness avoids a narrow critical window.

desk verdict A substantial, detailed proof of the first counting results for rational points near Brownian motion, with a genuinely new exponent 5 and a clean area theorem; the abstract overstates coverage by ignoring a logarithmic gap in the almost sure regime. read the letter →

arxiv 2608.21632 v1 pith:GZJRJDTI submitted 2026-08-21 math.NT math.CAmath.FAmath.PR

Faustin Adiceam , Volodymyr Pavlenkov , Evgeniy Zorin This is my paper · ORCID
classification math.NTmath.CAmath.FAmath.PR MSC 11J8360J6511K6060G1728A80
keywords DiophantineapproximationBrownianmotionrationalpointsnearcurvesareaheuristicsecondmomentmethodhittingprobabilitiestubularneighbourhoodmultifractalanalysis
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 proves that the number of rational points with denominator at most Q lying in a (δ/Q)-tube around the graph of Brownian motion has, almost surely, a precise asymptotic shape for essentially every tube thickness. When δ(Q)$Q^{5}$ grows faster than a power of log Q, the count is asymptotically (4/(3√π))(T2−T1)√(δ(Q)$Q^{5}$); when δ(Q)$Q^{5}$ shrinks faster than an inverse power of log Q, the count is eventually zero. This gives a strong form of the area heuristic for a continuous, nowhere differentiable curve, and upgrades the Diophantine-approximation programme for Brownian graphs from extremality to exact counting. The paper also establishes the almost sure area formula for the tubular neighbourhood and a general approximation-function counting theorem, and connects the results to a conjectural oscillation principle linking rational-point counts to local Hölder regularity.

What carries the argument

The argument is carried by the Second Moment Method on the probability space of Brownian motion. The count is written as a sum over rational-centred squares, and its mean and variance are expressed through diagonal and off-diagonal hitting probabilities: the probability that a Brownian trajectory enters one small rectangle, and the probability that it enters two. Sharp rectangle-hitting estimates built from Gaussian error functions and the T-function deliver the asymptotics of these terms, while a slicing identity represents the tube area as an integral of local ranges of the path. A Mean–Variance Lemma then converts the moment estimates into almost sure asymptotics.

What would settle it

On a finely discretised Brownian path on [1,2], take δ(Q) = c(log Q)^3 / $Q^{5}$ and compute N♭(T;(δ,Q)) for increasing Q; if the ratio of the count to (4/(3√π))√($δQ^{5}$) does not approach 1, the Second Main Theorem is false. Separately, measuring the area of the η-neighbourhood of a path and checking whether bA/√η approaches 4/√π would test the area theorem that underlies the counting law.

Watch

Extended reading notes

Core claim

The central claim is that for almost every realisation of Brownian motion on a time interval [T1,T2] with T1>0, the counting function N♭(T;(δ,Q)) satisfies N♭(T;(δ,Q)) = (4/(3√π))(T2−T1)√(δ(Q)$Q^{5}$)(1+o(1)) whenever δ(Q)$Q^{5}$ ≫ (log Q)^{2+η}, and N♭(T;(δ,Q)) = 0 for all sufficiently large Q whenever δ(Q)$Q^{5}$ ≪ (log Q)^{−2−η}. The same method yields an asymptotic for a more general count with a denominator-dependent approximation function ξ(q), and identifies the almost sure leading term of the area of the tube as (4/√π)(T2−T1)√η. The dichotomy is left undetermined only in the critical window δ(Q)$Q^{5}$ ≍ 1, where the paper suggests a possible Poissonian transition.

Load-bearing premise

The whole argument presupposes that the time window starts strictly after t = 0, because near t = 0 Brownian motion is pinned to a known value and the proof's estimates exclude that case.

Editorial extensions

If this is right

  • The area heuristic holds almost surely for Brownian graphs at every non-critical thickness: the number of rational points is comparable to Q^3 times the area of the tube.
  • In the thin regime δ(Q)Q^5 ≪ (log Q)^{−2−η}, almost every Brownian path contains no rational points with denominator at most Q for all large Q, so intrinsic rational points never affect the count.
  • The general approximation-function version gives asymptotics for counts with thickness depending on the denominator, beyond the uniform δ-tube.
  • The counting and area statements transfer verbatim to any continuous process whose law is absolutely continuous with respect to Brownian motion, including Brownian motion with drift and Brownian bridges away from their pinning time.
  • The result completes the counting side of the Diophantine-approximation programme for Brownian graphs: extremality is upgraded to an exact asymptotic law.

Reading between the lines

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

  • If the critical regime δQ^5 ≍ 1 is indeed Poissonian, the dichotomy becomes a genuine phase transition: as δQ^5 crosses unity, the expected count in the tube crosses from order zero to infinity, at the scale where the expected number of available rational points is of order one.
  • The proof strategy may suggest a route to the proposed oscillation principle for deterministic monofractal functions: any such function with controlled tube-area growth and no rational points on its graph would inherit a rational-point counting law with exponent set by its Hölder exponent.
  • The rectangle-hitting estimates could be exported to other Markov or stationary processes, yielding analogous area laws and critical Diophantine exponents, although the paper does not develop this direction.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper studies the number of rational points with bounded denominators lying in a shrinking tubular neighbourhood of the graph of a typical Brownian trajectory. It establishes three types of results: an almost sure asymptotic expansion for a general approximation function (First Main Theorem); a sharp dichotomy for the uniform thickness function δ(Q), namely an asymptotic expansion when δ(Q)Q^5 ≫ (log Q)^{2+η} and almost sure vanishing when δ(Q)Q^5 ≪ (log Q)^{-2-η} (Second Main Theorem); and a convergence-with-probability-one version of the same dichotomy in the intermediate range (Auxiliary Theorem). A further theorem gives the exact first moment and almost sure asymptotics of the area of the tubular neighbourhood, confirming the area heuristic away from a critical scale. The proofs use second-moment methods, precise estimates for the probability that Brownian motion hits a rectangle, and a four-regime decomposition of the off-diagonal contribution. The paper also proposes an Oscillation Principle conjecturally relating counting functions to uniform oscillation exponents.

Significance. If the results are accepted, this is the first counting result for rational points near a genuinely irregular, almost surely nowhere differentiable curve, and it goes beyond the regularity assumptions (C^2 with curvature bounds) of Huang and Vaughan–Velani. The machine-checkable structure of the long proof is a strength: the moment estimates (Propositions 3.2–3.4) and the hitting-probability estimates (Proposition 4.2, Corollary 4.3) are derived from explicit calculations rather than from fitting parameters, and the Tubular Neighbourhood Area Theorem is proved independently of the counting theorems, so there is no circularity. The paper also gives a new exact formula for the expectation of the area of the graph tube, which is of independent interest. The Oscillation Principle is clearly labelled as a conjecture and does not affect the validity of the main theorems.

major comments (3)
  1. [Abstract and §1.3, after Theorem (1.14)–(1.17)] The abstract's claim of an almost sure asymptotic expansion 'for all possible values of δ, with the sole exception of an isolated critical regime' is not supported by the Second Main Theorem as stated. The theorem covers δ(Q)Q^5 ≫ (log Q)^{2+η} and δ(Q)Q^5 ≪ (log Q)^{-2-η}, but the whole intermediate logarithmic interval, for example δ(Q)Q^5 = 1 or δ(Q)Q^5 = log log Q, is not covered. The proof in §3.3 genuinely uses these separations: the Borel–Cantelli step around (3.45) requires the grid points to satisfy sqrt(δ' (Q')^5) ≥ c_3 j^{1+η/2}, and the zero law uses summability of sqrt(R_j) in (3.53). For intermediate δ, only the Auxiliary Theorem's convergence-in-probability statements apply. The sentence in §1.3 that 'the only regime where the probabilistic behavior ... remains undetermined is when δ equals, up to logarithmic powers, Q^{-5}' should therefore be revised to describe the unresolved logarithmic gap, and the abstract should be narrowed accordingly.
  2. [§3, inequality (3.18), and §1.3] All the counting theorems require the denominators to satisfy Q_1 ≥ max(4/T_1, 1/(T_2−T_1), 2/T_2, ...), so the almost sure statements do not cover tubes anchored at T_1 = 0. The theorem statements are explicit about this, but the abstract and the introductory narrative do not flag it, despite the fact that Brownian motion takes a fixed value at time zero and the local behaviour there is different. This is a genuine limitation of the advertised 'all values of δ' and 'minimal regularity' message. The text should state in the abstract or Introduction that the results concern windows strictly away from the origin, or explain why the T_1 = 0 case is expected to be covered by a separate argument.
  3. [§3.3, proof of (1.14), equation (3.46)] The passage from the grid estimates to all Q and δ in (3.46)–(3.48) uses the envelope bounds (3.43), which require c_1 and c_2 to be chosen independently of the dyadic block. The text asserts that this is possible under the assumptions limsup δ(Q) < 1/4 and δ(Q)Q^5 ≫ (log Q)^{2+η}. This is correct for the lower bound, but the upper bound c_2 2^{-j} in (3.43) uses δ(Q) < 1/4 and is uniform. I verified the algebra, but the construction of the grid R_j in (3.41) with the lower endpoint c_1 j^{2+η} 2^{-6(j+1)} is somewhat compressed; a short justification that every point (Q, δ(Q)/Q) really lies in the claimed rectangle would help the reader, especially because the notation in (3.44) switches between δ' and r'.
minor comments (5)
  1. [§1.1] There are several typos: 'ivalidate' should be 'invalidate', 'neighboorhood' should be 'neighbourhood', and 'specialised' is used where 'specialized' or 'specialised' should be consistent with British spelling throughout.
  2. [§4, first paragraph] The text refers to 'Propositon3.3' instead of 'Proposition3.3'.
  3. [Title of §2 and Abstract] The displayed title 'T ubular Neighbourhood Area Theorem' contains a spurious space after the initial 'T'.
  4. [Figure 1 caption] The caption describes trajectories for times T_1 = 0 to T_2 = 1, but the main theorems require T_1 > 0; the figure is illustrative, yet the discrepancy with the theorem hypotheses could be noted.
  5. [§1.3, Remark] The generalization to processes with absolutely continuous law is stated in a remark. Since it is immediate from the proof, it would be helpful to say explicitly which parts of the proofs are unchanged and whether the constants in the error terms remain absolute.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the counting theorems and the area theorem are independently derived from self-contained moment, probability, and hitting estimates; no fitted parameter or load-bearing self-citation is involved.

full rationale

The derivation chain is self-contained. The Second Main Theorem and Auxiliary Theorem follow from the Mean–Variance Lemma and from the moment estimates in Proposition 3.4, whose proof in Section 7 reduces to the diagonal/off-diagonal probability estimates of Propositions 3.2 and 3.3. These in turn are derived from the rectangle hitting probability estimates of Section 4, which are obtained directly from Brownian motion properties (symmetry, scaling, independence of increments, Law of Maximum, Strong Markov Property) and from explicit Gaussian integral identities. The Tubular Neighbourhood Area Theorem is proved independently in Section 2 from first and second moment estimates of the localised range and a Borel–Cantelli argument; it is not used as an input to the counting theorems but only to contextualise the area heuristic and to support the uniform oscillation discussion around Conjecture 1.2. No parameter is fitted to the target quantity, no uniqueness theorem is invoked from the authors' own prior work, and the self-citations (e.g., [2], [3], [4]) appear only as contextual references, not as load-bearing justifications. The abstract's wording that the almost sure expansion holds for all δ except an isolated critical regime overstates the logarithmic gap left between conditions (1.15) and (1.16), but that is an accuracy/scope concern about the advertised claim, not circularity in the proof. Accordingly, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claim rests on standard Brownian motion theory, the second moment method, and classical analytic estimates. No parameters are fitted to data; no new entities are postulated. All auxiliary constants are universal or chosen sufficiently large in the proofs.

assumptions (5)
  • standard math Standard linear Brownian motion exists with continuous paths, independent Gaussian increments, and scaling/reflection symmetries (P1-P4), used throughout the paper.
    Invoked in Sections 2-7 for all moment and hitting probability calculations; standard background from Mörters-Peres.
  • standard math Law of the maximum and reflection principle for Brownian motion, equation (1.31).
    Used in Section 2 for first moment of the tubular area and in Section 4 for rectangle hitting probabilities.
  • standard math Second moment method in the form of the Mean-Variance Lemma, with the divergence case taken from Harman [18, Lemma 1.5].
    The proof of the First Main Theorem in Section 3 relies on this lemma; the paper proves only the convergence case and cites the divergence case.
  • standard math Strong Markov property and first hitting decomposition for Brownian motion.
    Used in Section 6.2 (equation (6.21)) to decompose off-diagonal probabilities in Regime 1.
  • standard math Möbius inversion to pass from non-reduced to primitive rational points, cited to Huang [20, §2].
    Mentioned in the footnote to (1.1); not central to the main proof but used to interpret the counting function.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Rational Points and Brownian Motion." pith.science (2026). https://pith.science/paper/GZJRJDTI

@misc{pith2026260821632,
  author       = {Pith},
  title        = {Pith review of: Rational Points and Brownian Motion},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GZJRJDTI}},
  note         = {Machine review of arXiv:2608.21632}
}
abstract

Given a real-valued function $f$, let $\mathcal{N}_f(\delta, Q)$ be the number of rational points with denominators at most $Q\ge 1$ in the $(\delta/Q)$-tubular neighbourhood of the graph of the function $f$. A heuristic predicts that the number of such points grows like the area of the neighbourhood provided that $\delta$ is big enough (in a suitable sense). Considerable efforts have been committed to prove this heuristic for regular curves. This culminated in the works by Vaughan \& Velani~(2006) and by Huang~(2015) establishing an asymptotic expansion for $\mathcal{N}_f(\delta, Q)$ provided that $\delta\gg Q^{-1+\epsilon}$ for some $\epsilon>0$ when the map $f$ is, among other assumptions, twice continuously differentiable. The present work deals with the thus-far unexplored regime where minimal regularity conditions are imposed on the curve. More precisely, it is concerned with the case where the map $f$ is an a.s. realisation of the graph of Brownian motion. The main result establishes the existence of an almost sure asymptotic expansion for the counting function for all values of $\delta$, with the exception of a critical regime, thereby going well beyond the theory currently available for regular curves. A key ingredient in the proof is the derivation of the area heuristic, which relies on establishing the a.s. asymptotics of the area of the tubular neighbourhood of the graph of Brownian motion. This result has two main consequences: firstly, it completes the counting aspect of the theory of Diophantine approximation on the graph of Brownian motion initiated by Sprind\v{z}uk (1979). Secondly, it hints at the existence of a theory unifying the analysis of rational points near a curve on the one hand and, on the other, its local H\"older regularity and fine-scale oscillations. It thus builds a seemingly new bridge between Number Theory and Multifractal Analysis.

Figures

Figures reproduced from arXiv: 2608.21632 by the authors.

Figure 1
Figure 1. Trajectories of the standard linear Brownian motion between times T1 = 0 and T2 = 1. The use of probabilistic methods is crucial in the proof of the above statement to over￾come the impossibility to rely on Taylor expansions in the case of irregular curves. This idea was in some sense previously alluded in the context of establishing effective counting results in the case of random shifts of regular curves in [2] or… view at source ↗
Figure 2
Figure 2. Domain D (x −, y −, α) with its left and right components Dℓ(x −, y −, α) and Dr(x −, y −, α). Either or both of the quantities y− √ 2·x− and y+ √ 2·x− may be negative. Lemma 4.5 (Polar-type Representations for the Probabilities ν(R) and λ(R) when x − > 0). The probabilities ν(R) and λ(R) introduced in Lemma 4.4 admit the following alternative rep￾resentations depending on the domain D (x −, y −, α, β) defined in (4… view at source ↗
Figure 3
Figure 3. Disposition of squares in the four regimes under consideration. The quantities Hξ(q, q ′ ) and h (µ) ξ (q, q ′ ) are defined in (6.3) [PITH_FULL_IMAGE:figures/full_fig_p069_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    Homogeneous form inequalities (II): Lattice Point Counting

    Adiceam, Faustin. Homogeneous form inequalities (II): Lattice Point Counting. Dissertationes Math.,613(2026),48pp

    work page 2026

  2. [2]

    Vertical shift and simultaneous Diophantine approximation on polynomial curves.Proc

    Adiceam, Faustin. Vertical shift and simultaneous Diophantine approximation on polynomial curves.Proc. Edinb. Math. Soc. (2),58(2015), no.1,1–26

    work page 2015

  3. [3]

    Homogeneous form inequalities (I): Volume es- timates and the generalised metric Oppenheim conjecture.Trans

    Adiceam, Faustin; Marmon, Oscar. Homogeneous form inequalities (I): Volume es- timates and the generalised metric Oppenheim conjecture.Trans. Amer. Math. Soc., 378(2025), no.4,2643–2693

    work page 2025

  4. [4]

    Rational points close to non-singular algebraic curves.Mathematika,69(2023), no.4,957–987

    Adiceam, Faustin; Marmon, Oscar. Rational points close to non-singular algebraic curves.Mathematika,69(2023), no.4,957–987

    work page 2023

  5. [5]

    Bass, Richard F.Probabilistic techniques in analysis.Probab. Appl. (N. Y.). Springer– Verlag, New York,1995

    work page 1995

  6. [6]

    Diophantine approximation on planar curves and the distribution of rational points

    Beresnevich, Victor; Dickinson, Detta; Velani, Sanju. Diophantine approximation on planar curves and the distribution of rational points. With an Appendix II by Vaughan, Robert Charles.Ann. of Math. (2),166(2007), no.2,367–426

    work page 2007

  7. [7]

    Dio- phantine approximation on curves and the distribution of rational points: diver- gence theory.Adv

    Beresnevich, Victor; Vaughan, Robert Charles; Velani, Sanju; Zorin, Evgeniy. Dio- phantine approximation on curves and the distribution of rational points: diver- gence theory.Adv. Math.,388,2021

    work page 2021

  8. [8]

    Diophantine approximation on manifolds and the distribution of rational points: contributions to the convergence theory.Int

    Beresnevich, Victor.; Vaughan, Robert Charles; Velani, Sanju.; Zorin, Evgeniy. Diophantine approximation on manifolds and the distribution of rational points: contributions to the convergence theory.Int. Math. Res. Not.,10,2885-2908,2017

    work page 2017

Show all 36 references
  1. [9]

    Explicit bounds for rational points near planar curves and metric Diophantine approximation.Adv

    Beresnevich, Victor; Zorin, Evgeniy. Explicit bounds for rational points near planar curves and metric Diophantine approximation.Adv. Math.,225(2010), no. 6,3064–3087

    2010

  2. [10]

    The number of integral points on arcs and ovals

    Bombieri, Enrico; Pila, Jonathan. The number of integral points on arcs and ovals. Duke Math. J.,59(1989), no.2,337–357. REFERENCES 94

    1989

  3. [11]

    Simultaneous Diophantine approximation on polynomial curves.Mathematika,56(2010), no.1,77–85

    Budarina, Natalia; Dickinson, Detta; Levesley, Jason. Simultaneous Diophantine approximation on polynomial curves.Mathematika,56(2010), no.1,77–85

    2010

  4. [12]

    Cambridge University Press, New York,1957

    Cassels, John W.S.An introduction to Diophantine approximation.Cambridge Tracts in Mathematics and Mathematical Physics, No.45. Cambridge University Press, New York,1957

    1957

  5. [13]

    A.; Peres, Yuval; Sousi, Perla

    Charmoy, Philippe H. A.; Peres, Yuval; Sousi, Perla. Minkowski dimension of Brownian motion with drift.J. Fractal Geom.,1(2014), no.2,153–17

    2014

  6. [14]

    Second edition

    Falconer, Kenneth.Fractal geometry.Mathematical foundations and applications. Second edition. John Wiley & Sons, Inc., Hoboken, NJ,2003

    2003

  7. [15]

    The asymptotic distribution of the range of sums of independent random variables.Ann

    Feller, William. The asymptotic distribution of the range of sums of independent random variables.Ann. Math. Statistics,22(1951),427–432

    1951

  8. [16]

    Fully Developed Turbulence and Intermittency

    Frisch, Uriel; Parisi, Giorgio. Fully Developed Turbulence and Intermittency. In : Ghil, M., Benzi, R. and Parisi, G., Eds.,Turbulence and Predictability in Geophysical Fluid Dynamics and Climate Dynamics, North-Holland, New York,84–88,1985

    1985

  9. [17]

    Counting rational points near planar curves.Acta Arith.,165(2014), no.1,91–100

    Gafni, Ayla. Counting rational points near planar curves.Acta Arith.,165(2014), no.1,91–100

    2014

  10. [18]

    Harman, Glyn.Metric number theory.London Math. Soc. Monogr. (N.S.),18. The Clarendon Press, Oxford University Press, New York,1998

    1998

  11. [19]

    Sums and differences of threekth powers.J

    Heath-Brown, David Rodney. Sums and differences of threekth powers.J. Number Theory,129(2009), no.6,1579–1594

    2009

  12. [20]

    Rational points near planar curves and Diophantine approxi- mation.Adv

    Huang, Jing–Jing. Rational points near planar curves and Diophantine approxi- mation.Adv. Math.,274(2015),490–515

    2015

  13. [21]

    The rational points close to a curve.Ann

    Huxley, Martin Neil. The rational points close to a curve.Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4),21(1994), no.3,357–375

    1994

  14. [22]

    Die Grundlehren der mathematischen Wissenschaften, Band

    Itô, Kiyosi; McKean, Henry P ., Jr.Diffusion processes and their sample paths.Second printing, corrected. Die Grundlehren der mathematischen Wissenschaften, Band

  15. [23]

    The spectrum of singularities of Riemann’s function

    Jaffard, Stéphane. The spectrum of singularities of Riemann’s function. Rev. Mat. Iberoamericana,12(1996), no.2,441–460

    1996

  16. [24]

    Über die Gitterpunkte auf konvexen Kurven.Math

    Jarník, Vojte ¸ch. Über die Gitterpunkte auf konvexen Kurven.Math. Z.,24(1926), no.1,500–518

    1926

  17. [25]

    Imperial College Press, London,2005

    Klebaner, Fima C.Introduction to stochastic calculus with applications.Second edition. Imperial College Press, London,2005. REFERENCES 95

    2005

  18. [26]

    Effective results in the metric theory of quantita- tive Diophantine approximation.Adv

    Lee, Ying Wai; Scoones, Andrew. Effective results in the metric theory of quantita- tive Diophantine approximation.Adv. Math.482(2025), part C, Paper No.110631, 57pp

    2025

  19. [27]

    Mörters, Peter; Peres, Yuval.Brownian motion.With an appendix by Oded Schramm and Wendelin Werner. Camb. Ser. Stat. Probab. Math.,30. Cambridge University Press, Cambridge,2010

    2010

  20. [28]

    Tables for computing bivariate normal probabilities.Ann

    Owen, D. Tables for computing bivariate normal probabilities.Ann. Math. Statist. 27(1956),1075–1090

    1956

  21. [29]

    The rational points of a definable set.Duke Math

    Pila, J.; Wilkie, A.J. The rational points of a definable set.Duke Math. J.133(2006), no.3,591–616

    2006

  22. [30]

    Multifractal analysis and wavelets.New trends in applied harmonic analysis19–65

    Seuret, Stéphane. Multifractal analysis and wavelets.New trends in applied harmonic analysis19–65. Appl. Numer. Harmon. Anal. Birkhäuser/Springer, Cham,2016

    2016

  23. [31]

    Silverman

    Sprindžuk, Vladimir G.Metric theory of Diophantine approximations.Translated from the Russian and edited by Richard A. Silverman. With a foreword by Donald J. Newman. Scripta Series in Mathematics. V . H. Winston & Sons, Washington, DC; John Wiley & Sons, New York-Toronto-London,1979

    1979

  24. [32]

    Some alternative derivations of Craig’s formula.Math

    Stewart, Seán M. Some alternative derivations of Craig’s formula.Math. Gaz.101 (2017), no.551,268–279

    2017

  25. [33]

    The number of lattice points on a convex curve.J

    Swinnerton-Dyer, H.P .F. The number of lattice points on a convex curve.J. Number Theory6(1974),128–135

    1974

  26. [34]

    Sznitman, Alain-Sol.Brownian motion, obstacles and random media.Springer Mono- graphs in Mathematics, Berlin, Springer-Verlag,1998

    1998

  27. [35]

    Diophantine approximation on planar curves: the convergence theory.Invent

    Vaughan, R.C.; Velani, S. Diophantine approximation on planar curves: the convergence theory.Invent. Math.,166(2006), no.1,103–124

    2006

  28. [125]

    Springer-Verlag, Berlin-New York,1974

    1974

Pith tools

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