Matching works

4 works

math.CO — Combinatorics

Constructions and explicit power savings for point--unit-circle incidences

Contributed by Yuda Chen, Yifei Wang

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.

Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
Nov 15, 2026178 pages
PDFView work

math.NT — Number Theory

Forced 33-adic anomalies of S3S_3 cubic fields

Contributed by Shawn Krisman

Let kk be a totally real cubic field and pp a prime unramified in kk. The pp-adic regulator of kk is a 2×22\times2 determinant of pp-adic logarithms of units and is always divisible by p2p^2; call kk anomalous at pp if it is divisible by p3p^3. Among all 592421 totally real cubic fields of discriminant up to 10710^7, the proportion of anomalous fields matches a random-matrix prediction at every prime 5≤p≤315\le p\le 31, but at p=3p=3 it is 0.3810.381 instead of the predicted 0.4070.407. We explain this. For cubic fields of fundamental discriminant DD prime to 3, we show that the 3-class group and the ray class group modulo 9 of the quadratic field Q(D)\mathbb{Q}(\sqrt{D}) can force every cubic field of discriminant DD to be anomalous at 3. When the 3-class group of Q(D)\mathbb{Q}(\sqrt{D}) is cyclic, we decide exactly when kk is anomalous, in terms of one invariant for which we give an explicit formula by cubic residue and Hilbert symbols. The phenomenon comes from the failure of semisimplicity of F3[S3]\mathbb{F}_3[S_3] and has no analogue for p≥5p\ge 5. The results fix one or two 3-adic digits of the regulator and say nothing about Leopoldt's conjecture itself.

Primarily AI-generated textHuman understanding: no partsGalois cohomologyLeopoldt conjecturePoitou-Tate dualityS3 extensionscup productsp-adic regulatorp-rationalityray class groupsrestricted ramificationtotally real cubic fields
Oct 26, 202613 pages
PDFView work

math.NT — Number Theory

Stark units for real quadratic fields and reciprocity laws

Contributed by Danylo Radchenko, Campbell Wheeler

We prove that every value of the arithmetic finite quantum dilogarithms constructed by Radchenko and Wheeler (arXiv:2609.21892) is an algebraic unit, and determine the Artin action for arbitrary quadratic pseudolattices. In particular, the associated Stark units belong to the predicted ray class fields and have the predicted Galois action. We use finite Fourier transforms and distribution relations to obtain Frobenius congruences. We also give conductor bounds for individual values and obtain the unitary conjugates needed for Zauner's conjecture.

A mix of human-written and AI-generated textHuman understanding: all partsArtin reciprocityFrobenius congruencesReal quadratic fieldsStark unitsfinite quantum dilogarithmsray class fields
Oct 10, 202622 pages
PDFView work

math.CO — Combinatorics

An Exponent of 1.043 for the Unit Distance Problem

Contributed by Eric Naslund

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.043171→∞u(U_j)/|U_j|^{1.043171}\to\infty. The largest exponent previously claimed, apart from preliminary versions of the present work, is 1.03581.0358, in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin. Here unit distances come from elements of relative norm one in quadratic extensions K/FK/F in which FF has both real and complex places, and the fields come from an infinite pro-22 tower over $\Q(\sqrt{241})$, ramified only above 22, 33 and 55, with Frobenius conditions at the two primes above 2929 and at one prime above 4141. The relative zeta value is bounded through the dihedral quotients of the tower group: the tower group has 2727 quotients isomorphic to the dihedral group of order~88; fifteen of them detect, by a census, the residue degree of the primes that split completely in the Kummer field up to norm 4⋅10134\cdot10^{13}, and seven of them generate a field EW′′E_{W''} of degree 81928192 contained in every field of the tower. We write ζEW′′\zeta_{E_{W''}} as a product of LL-functions of degrees 22, 44 and~88, evaluate the 576576 of degrees 44 and 88 rigorously at 2121 real points near~11, and combine the values through a kernel inequality with coefficients of both signs. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. Partial formalization PALOMAR-2026-10-01-000018 v2

Primarily AI-generated textHuman understanding: some parts
Oct 02, 2026101 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations