betaFeedback

Reading v1View latest version

Abstract

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.04273→∞u(U_j)/|U_j|^{1.04273}\to\infty. The largest exponent previously claimed, 1.03581.0358, is in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin: unit distances come from elements of relative norm one in quadratic extensions, and the fields come from an infinite pro-22 class field tower. The new ingredients are quadratic extensions of mixed signature, with an exact average over their norm-one units, and a tower over the real quadratic field \Q(\sqrt{241}), in which 22, 33 and 55 split. Its Golod–Shafarevich function contains two copies of the local conditions at these primes but only one constant term, and the extra room lets the tower be ramified only above 22, 33 and 55; the root discriminant of its fields is about 286286. The relative zeta value is bounded through the zeta function of the degree-512512 field generated over \Q(\sqrt{241}) by the square roots of its {2,3,5}\{2,3,5\}-units, which is the product of the Dedekind zeta function of \Q(\sqrt{241}) and 255255 quadratic Hecke LL-functions. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. A significant portion of this work was verified in Lean, reducing the result with exponent 1.04271.0427 to an explicit zeta function inequality (Palomar registry, PALOMAR-2026-10-01-000018, version 1).

Introduction

For a finite set U⊂R2U \subset\mathbb{R}^2, let

u(U)=#{{x,y}⊂U:∣x−y∣=1},u(n)=max⁡∣U∣=nu(U),u(U)=\#\{\{x,y\}\subset U:|x-y|=1\}, \qquad u(n)=\max_{|U|=n}u(U),

where the pairs are unordered and the distance is Euclidean. The unit distance problem of Erdős [6] asks for the order of growth of u(n)u(n). Our main result is the following.

Theorem 1.1. There are finite sets Uj⊂R2U_j \subset\mathbb{R}^2, with ∣Uj∣→∞|U_j| \to\infty, such that

u(Uj)∣Uj∣1.04273→∞.\frac{u(U_j)}{|U_j|^{1.04273}} \to\infty.

In particular, u(n)≥n1.04273u(n) \ge n^{1.04273} for arbitrarily large integers nn.

The largest exponent previously claimed, 1.0358324, is in the author’s unpublished manuscript [23]. Theorem 1.1 uses the same number-field method with several new ingredients: fields of mixed signature, averaged over their norm-one units; an infinite pro-2 extension of the real quadratic field Q(241)\mathbb{Q}(\sqrt{241}), with restricted ramification and a nonabelian local Galois group at the primes above 2; an explicit bound for the relative zeta value (defined in Subsection 1.2) from the quadratic LL-functions of a Kummer field of degree 512; and optimized profiles: smooth or locally constant weight functions at the archimedean places and at finitely many primes, whose product determines, through its superlevel sets, the region in which lattice points are counted. Subsection 1.3 describes them. The theorem concerns an unbounded sequence of cardinalities. Its proof uses no unproved hypothesis, such as the generalized Riemann hypothesis, but it is computer-assisted: finite facts about the tower and several numerical inequalities are verified by exact computation and interval arithmetic, as described in Subsection 1.6.

Background

Erdős [6] showed that a suitable section of a scaled integer lattice gives

u(n)≥n1+c0/log⁡log⁡nu(n) \ge n^{1+c_{0}/\log\log n}

for some c0>0c_{0}>0 and arbitrarily large nn, and he conjectured that this is essentially optimal [6, 7]. The best upper bound,

u(n)=O(n4/3),u(n)=O(n^{4/3}),

is due to Spencer, Szemerédi and Trotter [34]; Székely [36] gave a proof by crossing numbers.

In 2026 a team at OpenAI [27] disproved Erdős’s conjecture. They constructed sets with u(U)≥∣U∣1+δu(U)\ge|U|^{1+\delta} for a fixed δ>0\delta>0 and arbitrarily large ∣U∣|U|, replacing the integer lattice by ideal lattices in number fields of large degree and small root discriminant. Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang and Wood [1] simplified the argument and obtained δ≈6⋅10−38\delta\approx6\cdot10^{-38}. Sawin [32] made every step explicit and sharpened it, and reached the exponent 1.014114.

Improvements followed within days in online discussions. On the Erdős Problems forum, mlewko [20] reached 1.031849 in Sawin’s criterion with finite data found by ChatGPT, and on MathOverflow spiderduckpig [35] adjusted these data to reach 1.031883. In a comment the next day, spiderduckpig proposed a structural change: in the Golod–Shafarevich step of Sawin’s argument [32], Lemma 11, replace the unweighted count of relations by a count weighted by degree in the Zassenhaus filtration (recalled in Section 2). This was reported to give δ≥0.0333487\delta\ge0.0333487 [35]. Weighted counts of this kind underlie the towers of [23] and of the present paper. The author’s MathOverflow answer [21] then combined this count with covolume counting, dyadic ramification and Euler products over a fixed subfield. The manuscript [23] is a formal write-up of that construction, and it records δ=0.0358324\delta=0.0358324. Table 1 lists the explicit exponents, and the repository [28] records further bounds posted online.

ExponentSourceMain new inputKind of source
1+c0/log⁡log⁡n1+c_{0}/\log\log nErdős [6]integer latticejournal
1+δ, δ>01+\delta,\ \delta>0OpenAI [27]ideal lattices from class field towersmanuscript
1+6⋅10−381+6\cdot10^{-38}Alon et al. [1]simplified argumentpreprint
1.014114Sawin [32]explicit and sharpened criterionpreprint
1.015263Emmerich [4]optimized parameterspreprint
1.031185Emmerich, Cordella [5]extended range of primesonline certificate
1.031849mlewko [20]finite data found by ChatGPTforum post
1.0333487spiderduckpig [35]weighted Zassenhaus countonline post
1.0358324Naslund [23, 21]covolume counting, dyadic ramification, fixed-subfield Euler productsmanuscript, online post
1.04273this papersee Subsection 1.3

Table 1. Explicit lower bounds u(n)≥n1+δu(n)\ge n^{1+\delta} for arbitrarily large nn, in increasing order. The exponents are rounded down and constant factors are omitted. The last column gives the kind of source; apart from Erdős’s, none of these bounds had appeared in a refereed journal when this paper was written.

The construction in outline

The construction carries Erdős’s lattice argument to number fields of large degree. Let KK be such a field, of degree 2d2d, with an involution ι\iota whose fixed field is FF. We take the points of a translated ideal lattice of KK that lie in a bounded region of K⊗RK \otimes\mathbb{R}. A complex embedding in which ι\iota acts as complex conjugation maps them injectively to the plane. It sends every difference of relative norm one over FF to a unit vector, so two points whose difference has relative norm one are at distance one. The exponent is then set by a balance between four quantities, each normalized as d−1d^{-1} times the logarithm of a count. First, equal-norm choices: if a prime p\mathfrak{p} of FF splits in KK as P⋅ιP\mathfrak{P} \cdot\iota\mathfrak{P}, the k+1k+1 ideals Pj(ιP)k−j\mathfrak{P}^{j}(\iota\mathfrak{P})^{k-j}, 0≤j≤k0 \le j \le k, all have relative norm pk\mathfrak{p}^{k}. When the construction uses these k+1k+1 ideals, we say that p\mathfrak{p} is used with exponent kk, and we call the primes so used the selected primes. Second, ideal classes: a choice of exponents 0≤jp≤kp0 \le j_{\mathfrak{p}} \le k_{\mathfrak{p}}, one at each selected prime p\mathfrak{p} (used with exponent kpk_{\mathfrak{p}}), gives the product of the ideals Pjp(ιP)kp−jp\mathfrak{P}^{j_{\mathfrak{p}}}(\iota\mathfrak{P})^{k_{\mathfrak{p}}-j_{\mathfrak{p}}}. For the choices whose ideals ∏pPjp\prod_{\mathfrak{p}}\mathfrak{P}^{j_{\mathfrak{p}}} lie in one class of Cl⁡(K)\operatorname{Cl}(K) modulo the image of Cl⁡(F)\operatorname{Cl}(F), there are elements of relative norm one that generate these products times one fixed fractional ideal, and keeping the most frequent class loses at most a factor equal to the order of that quotient (Lemma 5.6). Through the class-number formula, this loss is governed by the root discriminant λ\lambda of KK and by the relative zeta value LF(1)L_F(1), where LF(s)=ζK(s)/ζF(s)L_F(s)=\zeta_K(s)/\zeta_F(s). Third, the region: its shape decides how many pairs of points with difference of relative norm one lie in it, and its volume fixes the number of points. Fourth, density: using a prime p\mathfrak{p} with exponent kk also makes the ideal lattice denser by the factor NpkN\mathfrak{p}^{k}; since the exponent 1+δ1+\delta is measured against the number of points, this costs δklog⁡Np\delta k\log N\mathfrak{p} before division by dd.

Quantitatively, suppose that such fields exist with d→∞d \to\infty and a fixed root discriminant λ\lambda. Let (b,c)(b,c) be the signature of FF, so that d=b+2cd=b+2c, and put θ=c/d\theta=c/d; thus 2θ2\theta is the proportion of non-real embeddings of FF. Suppose also that the selected primes have uniform local types: they are all the primes of FF above the primes rr of a fixed finite set RR, each of them splits in KK, and all those above a given rr have the same absolute ramification index ere_r and residue degree frf_r (Definitions 2.41 and 5.4). Then FF has exactly d/(erfr)d/(e_rf_r) primes above each rr, and we use all of them with a common exponent krk_r. If the points are taken from one translate of a fixed ideal lattice, with no further weighting at the selected primes (unweighted shell profiles, Definition 6.5), the exponent 1+δ1+\delta is attained when

∑r∈Rlog⁡(kr+1)−δkrfrlog⁡rerfr−(12−δ)log⁡λ−C+Aδ(θ)>0.(1)\sum_{r \in R}\frac{\log(k_r+1)-\delta k_rf_r\log r}{e_rf_r} -\left(\frac{1}{2}-\delta\right)\log\lambda-C+\mathcal{A}_{\delta}(\theta)>0. \tag*{(1)}

Here CC is an upper bound for d−1log⁡LF(1)d^{-1}\log L_F(1), and

Aδ(θ)=(1−δ)log⁡2+(1−θ)log⁡π+(1−2θ)JR+θJC\mathcal{A}_{\delta}(\theta)=(1-\delta)\log2+(1-\theta)\log\pi+(1-2\theta)\mathcal{J}_{\mathbb{R}}+\theta\mathcal{J}_{\mathbb{C}}

is the archimedean contribution. In it, JR\mathcal{J}_{\mathbb{R}} and JC\mathcal{J}_{\mathbb{C}} are the functionals of the profiles at the real and at the complex places of FF (Definition 5.22); they compare how much a profile overlaps its translates by elements of relative norm one with its mass. We call the left side of (1) the margin. Proposition 5.26, the geometric transfer, makes this precise for quadratic extensions K/FK/F with KK totally imaginary, FF with a real place and K/FK/F unramified at every finite place: under conditions on the profiles, if the margin is bounded below by a positive constant along such a family, then there are finite sets Uj⊂R2U_j \subset\mathbb{R}^{2} with ∣Uj∣→∞|U_j| \to\infty and u(Uj)/∣Uj∣1+δ→∞u(U_j)/|U_j|^{1+\delta} \to\infty. Section 6 allows general shell profiles, weighted sums of indicator functions of sets defined by valuations (Definition 6.5 and Proposition 6.21). This replaces each summand of the sum over RR in (1) by log⁡Fδ,r/(erfr)\log\mathcal{F}_{\delta,r}/(e_rf_r), where Fδ,r\mathcal{F}_{\delta,r} is the value of the local functional of Definition 6.1 at the shell profile used above rr; we still call the resulting left side the margin (Corollary 6.23). Section 8 proves a positive lower bound for it at δ=0.04273\delta=0.04273.

The fields must form an infinite family of growing degree with fixed λ\lambda and fixed types at the selected primes. Such families come from towers, pro-2 extensions with restricted ramification and prescribed local Galois groups, when these are infinite. Golod–Shafarevich arguments [10] show that a tower is infinite when an explicit function of t∈(0,1)t \in(0,1), built from the number of generators of its Galois group and from its local conditions, takes a negative value; here that function is the Golod–Shafarevich function PBP_B of (12), and Proposition 2.39 proves the criterion for it. The use of Frobenius conditions to control splitting in such towers goes back to Hajir, Maire and Ramakrishna [11].

New ingredients

The construction differs from those of Sawin [32] and of [23] in four ways.

Mixed signature. In Sawin’s construction, and in [23], the field KK is a CM field: complex conjugation is central in Gal⁡(K/Q)\operatorname{Gal}(K/\mathbb{Q}), FF is totally real, every norm-one element has modulus one at every archimedean place, and the norm-one units are finite. Here KK is totally imaginary and Galois over B=Q(241)B=\mathbb{Q}(\sqrt{241}), and FF is the fixed field of one complex conjugation ι1\iota_1, which is not central: its conjugacy class has at least 2152^{15} elements, so θ≥θ∗=65535/131072\theta\geq\theta_* = 65535/131072 (Theorem 2.42) and almost every place of FF is complex. Above a complex place of FF the two coordinates of a norm-one element can have moduli eue^u and e−ue^{-u}, and the norm-one units, of rank cc, move uu along a lattice. Averaging over a fundamental domain of that lattice counts the resulting pairs of points exactly, and the class-number formula cancels the regulator of these units together with the capitulation kernel, the kernel of Cl⁡(F)→Cl⁡(K)\operatorname{Cl}(F)\to\operatorname{Cl}(K) (Proposition 5.2). Mixed signature therefore costs only a factor π\pi per complex place of FF, and a profile that couples the two coordinates at that place more than repays it.

A tower over Q(241)\mathbb{Q}(\sqrt{241}). Over a totally real base field in which every prime at which the tower is ramified splits completely, the Golod–Shafarevich function has a local term for every prime of the base above such a prime, but only one constant term (in (12), the terms 2ψD2\psi_D and 4ψC2×C24\psi_{C_2\times C_2}, and the constant 11). The field B=Q(241)B=\mathbb{Q}(\sqrt{241}) is the real quadratic field of smallest discriminant in which 2, 3 and 5 all split. Over BB we prescribe a nonabelian dyadic local Galois group of order 32 at each of the two primes above 2, a tame local group C2×C2C_2\times C_2 at each of the four primes above 3 and 5, and conditions that make the Frobenius elements have order dividing 4 at the two primes above 29 and at the prime 7, which is inert in BB. The relations are counted through their images in the Zassenhaus filtration, and one dyadic relation is implied by the others through Hilbert reciprocity. The resulting tower is infinite, it is ramified only above 2, 3 and 5, and its Galois group has 8 generators. The fields of Theorem 2.42 have root discriminant

λ=29/43615≈286.0,3615=3⋅5⋅241.\lambda=2^{9/4}\sqrt{3615}\approx286.0,\qquad3615=3\cdot5\cdot241.

Sawin’s fields come from a pro-2 tower of unramified extensions of Q(3⋅5⋯43)\mathbb{Q}(\sqrt{3\cdot5\cdots43}), so they are ramified over Q\mathbb{Q} at 2 and at the thirteen odd primes up to 43, and their root discriminant is about 1.6⋅1081.6\cdot10^8. Theorem 2.42 states the family of fields.

References

  1. [1]Noga Alon, Thomas F. Bloom, W. T. Gowers, Daniel Litt, Will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, and Melanie Matchett Wood, Remarks on the disproof of the unit distance conjecture, 2026, arXiv:2605.20695v1; https://arxiv.org/abs/2605.20695v1.
  2. [2]Leonardo de Moura and Sebastian Ullrich, The Lean 4 theorem prover and programming language, Automated Deduction—CADE 28 (Cham) (André Platzer and Geoff Sutcliffe, eds.), Lecture Notes in Computer Science, vol. 12699, Springer, 2021, pp. 625–635.
  3. [3]Tim Dokchitser, Computing special values of motivic L-functions, Experimental Mathematics 13 (2004), no. 2, 137–149.
  4. [4]Michael T. M. Emmerich, Optimizing explicit unit-distance lower-bound certificates, 2026, arXiv:2606.03419v5, June 9, 2026 (v1 June 2, 2026); certificate with δ = 0.015263 . . .; https://arxiv.org/abs/2606.03419v5.
  5. [5]Michael T. M. Emmerich and Francesco Cordella, Optimized certificate for the unit distance problem with extended prime number range, Zenodo record, June 5, 2026, Certificate and verification code. https://doi.org/10.5281/zenodo.20551478.
  6. [6]Paul Erdős, On sets of distances of n points, The American Mathematical Monthly 53 (1946), no. 5, 248–250, https://doi.org/10.1080/00029890.1946.11991674.
  7. [7]———, Some problems in number theory, combinatorics and combinatorial geometry, Mathematica Pannonica 5 (1994), no. 2, 261–269.
  8. [8]Mikhail Ershov, Golod–Shafarevich groups: a survey, International Journal of Algebra and Computation 22 (2012), no. 5, 1230001, 68 pages.DOI
  9. [9]Ralph H. Fox, Free differential calculus. I: Derivation in the free group ring, Annals of Mathematics 57 (1953), no. 3, 547–560.DOI
  10. [10]E. S. Golod and I. R. Shafarevich, On the class field tower, Izv. Akad. Nauk SSSR Ser. Mat. 28 (1964), no. 2, 261–272 (Russian), English translation: Amer. Math. Soc. Transl. (2) 48 (1965), 91–102; https://www.mathnet.ru/eng/im2955.
  11. [11]Farshid Hajir, Christian Maire, and Ravi Ramakrishna, Cutting towers of number fields, Annales mathématiques du Québec 45 (2021), no. 2, 321–345.arxiv.org/abs/1901.04354
  12. [12]Erich Hecke, Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen. Zweite Mitteilung, Mathematische Zeitschrift 6 (1920), 11–51, https://doi.org/10.1007/BF01202991.
  13. [13]S. A. Jennings, The structure of the group ring of a p-group over a modular field, Transactions of the American Mathematical Society 50 (1941), no. 1, 175–185, https://doi.org/10.2307/1989916.
  14. [14]Fredrik Johansson, Rigorous high-precision computation of the Hurwitz zeta function and its derivatives, Numerical Algorithms 69 (2015), no. 2, 253–270.arxiv.org/abs/1309.2877
  15. [15]———, Arb: Efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Transactions on Computers 66 (2017), no. 8, 1281–1292, https://doi.org/10.1109/TC.2017.2690633.
  16. [16]Stéphane Louboutin, Explicit bounds for residues of Dedekind zeta functions, values of L-functions at s = 1, and relative class numbers, Journal of Number Theory 85 (2000), no. 2, 263–282, https://doi.org/10.1006/jnth.2000.2545.
  17. [17]James S. Milne, Lectures on étale cohomology, 2013, Version 2.21, March 22, 2013; https://www.jmilne.org/math/CourseNotes/LEC.pdf.
  18. [18]———, Algebraic number theory, 2020, Version 3.08, July 19, 2020; https://www.jmilne.org/math/CourseNotes/ANT.pdf.
  19. [19]———, Class field theory, 2020, Version 4.03, August 6, 2020; https://www.jmilne.org/math/CourseNotes/CFT.pdf.
  20. [20]mlewko, Post in the discussion thread of Erdős Problem #90, Erdős Problems forum, May 21, 2026, Reports δ = 0.031849981 . . . in Sawin’s criterion, with finite data found by ChatGPT; accessed September 30, 2026; https://www.erdosproblems.com/forum/thread/90.
  21. [21]Eric Naslund, Answer to “What is the unit distance exponent?”, MathOverflow, answer 511576, 2026, Posted May 23, 2026, last edited June 9, 2026; accessed September 30, 2026; https://mathoverflow.net/a/511576.
  22. [22]———, An exponent of 1.04273 for the unit distance problem: Lean formalization at exponent 1.0427, conditional on one zeta inequality, Palomar registry, PALOMAR-2026-10-01-000018, version 1, 2026, https://palomar-registry.org/entry?id=PALOMAR-2026-10-01-000018&version=1; Lean 4 source at https://github.com/enaslund/unit-distance-bound-0.0427/tree/e0ac836176016dbefae28646bc91fc3a5aca30e8/lean.
  23. [23]———, An improved explicit lower bound for the unit distance problem, Unpublished manuscript, 2026, Records exponent 1.0358324. https://github.com/enaslund/unit-distance-bound-0.0427/tree/8ab94da4ba4faf6f6d8fe43c298f04c3b284e796/papers/0.0358324.
  24. [24]———, Supplementary programs and data for “An exponent of 1.04273 for the unit distance problem”, GitHub repository, directory papers/0.04273/certificates, 2026, https://github.com/enaslund/unit-distance-bound-0.0427.
  25. [25]National Institute of Standards and Technology, NIST Digital Library of Mathematical Functions, 2026, Release 1.2.8, September 15, 2026; accessed September 27, 2026; https://dlmf.nist.gov/.
  26. [26]Jürgen Neukirch, Alexander Schmidt, and Kay Wingberg, Cohomology of number fields, 2 ed., Grundlehren der mathematischen Wissenschaften, vol. 323, Springer, Berlin, Heidelberg, 2008.DOI
  27. [27]OpenAI, Planar point sets with many unit distances, Research manuscript, May 20, 2026, https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-proof.pdf.
  28. [28]Erdős unit distance exponent, Entry 84a of Optimization Constants in Mathematics, a crowdsourced repository started by Terence Tao, 2026, Accessed September 30, 2026; https://teorth.github.io/optimizationproblems/constants/84a.html.
  29. [29]Bjorn Poonen, Rational points on varieties, Graduate Studies in Mathematics, vol. 186, American Mathematical Society, Providence, RI, 2017, https://math.mit.edu/~poonen/papers/Qpoints.pdf.DOI
  30. [30]Claudio Quadrelli, Pro-p groups with few relations and universal Koszulity, Mathematica Scandinavica 127 (2021), no. 1, 28–42, https://doi.org/10.7146/math.scand.a-123644.
  31. [31]D. G. Quillen, On the associated graded ring of a group ring, Journal of Algebra 10 (1968), no. 4, 411–418, https://doi.org/10.1016/0021-8693(68)90069-0.
  32. [32]Will Sawin, An explicit lower bound for the unit distance problem, 2026, arXiv:2605.20579v1; https://arxiv.org/abs/2605.20579v1.
  33. [33]Jean-Pierre Serre, A course in arithmetic, Graduate Texts in Mathematics, vol. 7, Springer, New York, 1973.DOI
  34. [34]Joel Spencer, Endre Szemerédi, and William T. Trotter, Jr., Unit distances in the Euclidean plane, Graph Theory and Combinatorics (Béla Bollobás, ed.), Academic Press, London, 1984, https://trotter.math.gatech.edu/papers/44.pdf, pp. 293–303.
  35. [35]spiderduckpig, Answer to “What is the unit distance exponent?”, MathOverflow, answer 511531, 2026, Posted May 21, 2026, with 1 + δ ≥ 1.03188306553964 . . .; comment of May 22, 2026 proposing a weighted count in the Zassenhaus filtration in Sawin’s Golod–Shafarevich step, with δ ≥ 0.0333487156372102; last edited June 9, 2026; accessed September 30, 2026; https://mathoverflow.net/a/511531.
  36. [36]László A. Székely, Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability and Computing 6 (1997), no. 3, 353–358, https://doi.org/10.1017/S09635483097002976.
  37. [37]John T. Tate, Fourier analysis in number fields and Hecke’s zeta-functions, Algebraic Number Theory (J. W. S. Cassels and A. Fröhlich, eds.), Academic Press, London, 1967, Originally a Princeton University doctoral thesis, 1950; https://www.lms.ac.uk/publications/algebraic-number-theory, pp. 305–347.
  38. [38]The FLINT team, FLINT: Fast Library for Number Theory, 2026, Version 3.6.0, used through python-flint 0.9.0; https://flintlib.org.
  39. [39]The mathlib Community, The Lean mathematical library, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, ACM, 2020, pp. 367–381.DOI
  40. [40]The mpmath development team, mpmath: A Python library for arbitrary-precision floating-point arithmetic, 2023, Version 1.3.0; https://github.com/mpmath/mpmath/releases/tag/1.3.0.
  41. [41]The PARI Group, PARI/GP, Université de Bordeaux, 2025, Version 2.17.2; https://pari.math.u-bordeaux.fr/.
  42. [42]M. A. Tsfasman and S. G. Vlăduţ, Infinite global fields and the generalized Brauer–Siegel theorem, Moscow Mathematical Journal 2 (2002), no. 2, 329–402, https://doi.org/10.17323/1609-4514-2002-2-2-329-402.

Paper details

vlnc:W_64dxrxcs
Published
Added
License
CC BY 4.0
Usage

views · 21

downloads · 10

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

OpenAI ChatGPT Astra 6, OpenAI ChatGPT Sol 5.6, Anthropic Claude Opus 5.5, Meta Muse Spark 1.3 Contributor

View statement
Looking for related papers…
Contents