Saved in:
Bibliographic Details
Main Authors: Bonolis, Dante, Pierce, Lillian B., Woo, Katharine
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.23334
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912980475576320
author Bonolis, Dante
Pierce, Lillian B.
Woo, Katharine
author_facet Bonolis, Dante
Pierce, Lillian B.
Woo, Katharine
contents In the 1980's Serre asked how many points of bounded height can lie in a thin set. This has motivated significant research ever since, culminating in a series of recent breakthroughs. It is a good time to take stock of the central questions that have been resolved, and also to highlight remaining open questions. First, we survey recent progress on counting points of bounded height in the four types of thin sets, according to the projective/affine and type I/type II designations. Second, we turn to questions of uniformity. Famously, in the setting of type I thin sets, the best-known upper bound for the number of points of bounded height is independent of the maximum size, say $\|F\|$, of the coefficients of the polynomials that define the thin set; such an upper bound is called uniform. A uniform upper bound in the setting of type II thin sets is not known. For type II thin sets, we explore the dependence on $\|F\|$ via several strategies, and construct counterexamples that suggest the question of uniformity is quite subtle in the setting of type II thin sets.
format Preprint
id arxiv_https___arxiv_org_abs_2603_23334
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Counting points in thin sets: A survey
Bonolis, Dante
Pierce, Lillian B.
Woo, Katharine
Number Theory
In the 1980's Serre asked how many points of bounded height can lie in a thin set. This has motivated significant research ever since, culminating in a series of recent breakthroughs. It is a good time to take stock of the central questions that have been resolved, and also to highlight remaining open questions. First, we survey recent progress on counting points of bounded height in the four types of thin sets, according to the projective/affine and type I/type II designations. Second, we turn to questions of uniformity. Famously, in the setting of type I thin sets, the best-known upper bound for the number of points of bounded height is independent of the maximum size, say $\|F\|$, of the coefficients of the polynomials that define the thin set; such an upper bound is called uniform. A uniform upper bound in the setting of type II thin sets is not known. For type II thin sets, we explore the dependence on $\|F\|$ via several strategies, and construct counterexamples that suggest the question of uniformity is quite subtle in the setting of type II thin sets.
title Counting points in thin sets: A survey
topic Number Theory
url https://arxiv.org/abs/2603.23334