math.CO — Combinatorics
Constructions and explicit power savings for point--unit-circle incidences
Let be the maximum number of incidences between distinct points and distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing and , the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent . The second gives balanced configurations along an unbounded sequence with exponent , and further unbalanced configurations. The upper bound is , where . 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.