Thin sets in weighted projective stacks
Stephanie Chan, Daniel Loughran, Nick Rome
TL;DR
We address counting rational points on weighted projective stacks outside thin subsets by proving a stacky Serre-type bound, driven by a new lopsided large sieve over number fields. The main technical advance is a large sieve tailored to unit-group dynamics and height on stacks, enabling sharp bounds for points avoiding prescribed residue classes modulo primes. This leads to a strong quantitative statement: 100% of odd hyperelliptic curves over a number field, ordered by weighted height, do not admit a prescribed nontrivial level structure. The results unify stack-theoretic Hilbert property considerations with moduli-space arithmetic and open avenues for counting problems on stacks beyond classical schemes.
Abstract
We prove an upper bound for the number of rational points of bounded height in a weighted projective stack which lie in a given thin subset. As a consequence, we show that $100\%$ of hyperelliptic curves do not admit a prescribed on-trivial level structure.
