Searcharxiv⌕ Search

arXiv subjects

Lillian B. Pierce

Publications and source records attributed to Lillian B. Pierce.

At least 19 recordsLinked to original sources
arXiv2026

Genuine and strongly genuine polynomials: With an application to the persistence of Galois groups under specialization

We develop the theory of strongly $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}')$ with $\mathbf{x}'=(x_2,\ldots,x_n) \in \mathbb{Z}^{n-1}$ (respectively $\mathbf{x}' \in \mathbb{F}_p^{n-1}$) such that $F(Y,X_1,\mathbf{x}')$ is reducible over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) can be well-controlled quantitatively. We also develop the theory of a larger class of $n$-genuine polynomials $F(Y,X_1,\ldots,X_n)$, which have the property that the number of specializations $F(Y,X_1,\mathbf{x}')$ with $\mathbf{x}' \in \mathbb{Z}^{n-1}$ (respectively $\mathbf{x}' \in \mathbb{F}_p^{n-1}$) such that $F(Y,X_1,\mathbf{x}')$ splits completely over $\overline{\mathbb{Q}}$ (respectively over $\overline{\mathbb{F}}_p$) into factors that are linear in $Y$ can be well-controlled quantitatively. For each of these classes, we prove that there are four equivalent characterizations. As an application, we demonstrate that $n$-genuine and strongly $n$-genuine polynomials can be used to prove, for any polynomial $F(Y,X_1,\ldots,X_n)$, an upper bound for the number of specializations $F(Y,\mathbf{x})$ with $\mathbf{x}=(x_1,\ldots,x_n) \in \mathbb{Z}^n$ such that the Galois group of the splitting field of $F(Y,\mathbf{x})$ over $\mathbb{Q}$ is not isomorphic to the Galois group of the splitting field of $F(Y,X_1,\ldots,X_n)$ over $\mathbb{Q}(X_1,\ldots,X_n)$. We simultaneously prove analogous results over any number field.

math.NT↗
arXiv2026

A guide to Tauberian theorems for arithmetic applications

A Tauberian theorem deduces an asymptotic for the partial sums of a sequence of non-negative real numbers from analytic properties of an associated Dirichlet series. Tauberian theorems appear in a tremendous variety of applications, ranging from well-known classical applications in analytic number theory, to new applications in arithmetic statistics, group theory, and the intersection of number theory and algebraic geometry. The goal of this article is to provide a useful reference for practitioners who wish to apply a Tauberian theorem. We explain the hypotheses and proofs of two types of Tauberian theorems: one with and one without an explicit remainder term. We furthermore provide counterexamples that illuminate that neither theorem can reach an essentially stronger conclusion unless its hypothesis is strengthened.

math.NT↗
arXiv2026

Counting points in thin sets: A survey

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.

math.NT↗
arXiv2026

Application of a polynomial sieve: beyond separation of variables

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized substantially: first to a power sieve, counting $\mathbf{x} \in [-B,B]^n$ for which $f(\mathbf{x})=y^r$ is solvable for $y \in \mathbb{Z}$; then to a polynomial sieve, counting $\mathbf{x} \in [-B,B]^n$ for which $f(\mathbf{x})=g(y)$ is solvable, for a given polynomial $g$. Formally, a polynomial sieve lemma can encompass the more general problem of counting $\mathbf{x} \in [-B,B]^n$ for which $F(y,\mathbf{x})=0$ is solvable, for a given polynomial $F$. Previous applications, however, have only succeeded in the case that $F(y,\mathbf{x})$ exhibits separation of variables, that is, $F(y,\mathbf{x})$ takes the form $f(\mathbf{x}) - g(y)$. In the present work, we present the first application of a polynomial sieve to count $\mathbf{x} \in [-B,B]^n$ such that $F(y,\mathbf{x})=0$ is solvable, in a case for which $F$ does not exhibit separation of variables. Consequently, we obtain a new result toward a question of Serre, pertaining to counting points in thin sets.

math.NT↗
arXiv2025

Counting integral points in thin sets of type II: singularities, sieves, and stratification

Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap \mathbb{Z}^n$ such that $F(y,\mathbf{x})=0$ is solvable for $y \in\mathbb{Z}$. In nomenclature of Serre, bounding $N(F,B)$ corresponds to counting integral points in an affine thin set of type II. Previously, in this generality Serre proved $N(F,B) \ll_F B^{n-1/2}(\log B)^γ$ for some $γ<1$. When $m \geq 2$, this new work proves $N(F,B) \ll_{n,F,ε} B^{n-1+1/(n+1) + ε}$ under a nondegeneracy condition that encapsulates that $F(Y,\mathbf{X})$ is truly a polynomial in $n+1$ variables, even after performing any $\text{GL}_n(\mathbb{Q})$ change of variables on $X_1,\ldots,X_n$. Under GRH, this result also holds when $m=1$. We show that generic polynomials satisfy the relevant nondegeneracy condition. Moreover, for a certain class of polynomials, we prove the stronger bound $N(F,B) \ll_{F} B^{n-1}(\log B)^{e(n)}$, comparable to a conjecture of Serre. A key strength of these results is that they require no nonsingularity property of $F(Y,\mathbf{X})$. The Katz-Laumon stratification for character sums, in a new uniform formulation appearing in a companion paper of Bonolis, Kowalski and Woo, is a key ingredient in the sieve method we develop to prove upper bounds that explicitly control any dependence on the size of the coefficients of $F$.

math.NT↗
arXiv2024

On Polynomial Carleson operators along quadratic hypersurfaces

We prove that a maximally modulated singular oscillatory integral operator along a hypersurface defined by $(y,Q(y))\subseteq \mathbb{R}^{n+1}$, for an arbitrary non-degenerate quadratic form $Q$, admits an a priori bound on $L^p$ for all $1<p<\infty$, for each $n \geq 2$. This operator takes the form of a polynomial Carleson operator of Radon-type, in which the maximally modulated phases lie in the real span of $\{p_2,\ldots,p_d\}$ for any set of fixed real-valued polynomials $p_j$ such that $p_j$ is homogeneous of degree $j$, and $p_2$ is not a multiple of $Q(y)$. The general method developed in this work applies to quadratic forms of arbitrary signature, while previous work considered only the special positive definite case $Q(y)=|y|^2$.

math.CA↗
arXiv2023

Generalizations of the Schrödinger maximal operator: building arithmetic counterexamples

Let $T_t^{P_2}f(x)$ denote the solution to the linear Schrödinger equation at time $t$, with initial value function $f$, where $P_2 (ξ) = |ξ|^2$. In 1980, Carleson asked for the minimal regularity of $f$ that is required for the pointwise a.e. convergence of $T_t^{P_2} f(x)$ to $f(x)$ as $t \rightarrow 0.$ This was recently resolved by work of Bourgain, and Du and Zhang. This paper considers more general dispersive equations, and constructs counterexamples to pointwise a.e. convergence for a new class of real polynomial symbols $P$ of arbitrary degree, motivated by a broad question: what occurs for symbols lying in a generic class? We construct the counterexamples using number-theoretic methods, in particular the Weil bound for exponential sums, and the theory of Dwork-regular forms. This is the first case in which counterexamples are constructed for indecomposable forms, moving beyond special regimes where $P$ has some diagonal structure.

math.CA↗
arXiv2022

Generalised quadratic forms over totally real number fields

We introduce a new class of generalised quadratic forms over totally real number fields, which is rich enough to capture the arithmetic of arbitrary systems of quadrics over the rational numbers. We explore this connection through a version of the Hardy-Littlewood circle method over number fields.

math.NT↗
arXiv2022

A new type of superorthogonality

We provide a simple criterion on a family of functions that implies a square function estimate on $L^p$ for every even integer $p \geq 2$. This defines a new type of superorthogonality that is verified by checking a less restrictive criterion than any other type of superorthogonality that is currently known.

math.CA↗
arXiv2022

On the strict majorant property in arbitrary dimensions

In this work we study $d$-dimensional majorant properties. We prove that a set of frequencies in ${\mathbb Z}^d$ satisfies the strict majorant property on $L^p([0,1]^d)$ for all $p> 0$ if and only if the set is affinely independent. We further construct three types of violations of the strict majorant property. Any set of at least $d+2$ frequencies in ${\mathbb Z}^d$ violates the strict majorant property on $L^p([0,1]^d)$ for an open interval of $p \not\in 2 {\mathbb N}$ of length 2. Any infinite set of frequencies in ${\mathbb Z}^d$ violates the strict majorant property on $L^p([0,1]^d)$ for an infinite sequence of open intervals of $p \not\in 2 {\mathbb N}$ of length $2$. Finally, given any $p>0$ with $p \not\in 2{\mathbb N}$, we exhibit a set of $d+2$ frequencies on the moment curve in ${\mathbb R}^d$ that violate the strict majorant property on $L^p([0,1]^d).$

math.CA↗
arXiv2022

Geometric generalizations of the square sieve, with an application to cyclic covers

We formulate a general problem: given projective schemes $\mathbb{Y}$ and $\mathbb{X}$ over a global field $K$ and a $K$-morphism $η$ from $\mathbb{Y}$ to $\mathbb{X}$ of finite degree, how many points in $\mathbb{X}(K)$ of height at most $B$ have a pre-image under $η$ in $\mathbb{Y}(K)$? This problem is inspired by a well-known conjecture of Serre on quantitative upper bounds for the number of points of bounded height on an irreducible projective variety defined over a number field. We give a non-trivial answer to the general problem when $K=\mathbb{F}_q(T)$ and $\mathbb{Y}$ is a prime degree cyclic cover of $\mathbb{X}=\mathbb{P}_{K}^n$. Our tool is a new geometric sieve, which generalizes the polynomial sieve to a geometric setting over global function fields.

math.NT↗
arXiv2022

Counting problems: class groups, primes, and number fields

Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central conjecture of Brumer and Silverman states that for each prime $\ell$, every number field has the property that its class group has very few elements of order $\ell$, where "very few" is measured relative to the absolute discriminant of the field. This paper surveys recent progress toward this conjecture, and outlines its close connections to counting prime numbers, counting number fields of fixed discriminant, and counting number fields of bounded discriminant.

math.NT↗
arXiv2022

Counterexamples for high-degree generalizations of the Schrödinger maximal operator

In 1980 Carleson posed a question on the minimal regularity of an initial data function in a Sobolev space $H^s(\mathbb{R}^n)$ that implies pointwise convergence for the solution of the linear Schrödinger equation. After progress by many authors, this was recently resolved (up to the endpoint) by Bourgain, whose counterexample construction for the Schrödinger maximal operator proved a necessary condition on the regularity, and Du and Zhang, who proved a sufficient condition. Analogues of Carleson's question remain open for many other dispersive PDE's. We develop a flexible new method to approach such problems, and prove that for any integer $k\geq 2$, if a degree $k$ generalization of the Schrödinger maximal operator is bounded from $H^s(\mathbb{R}^n)$ to $L^1(B_n(0,1))$, then $s \geq \frac{1}{4} + \frac{n-1}{4((k-1)n+1)}.$ In dimensions $n \geq 2$, for every degree $k \geq 3$, this is the first result that exceeds a long-standing barrier at $1/4$. Our methods are number-theoretic, and in particular apply the Weil bound, a consequence of the truth of the Riemann Hypothesis over finite fields.

math.CA↗
arXiv2021

Burgess bounds for short character sums evaluated at forms II: the mixed case

This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at any real-valued polynomial. The resulting upper bound for the mixed character sum is nontrivial when the length of the sum is at least $q^β$ with $β> 1/2 - 1/(2(n+1))$ in each coordinate. This work capitalizes on the recent stratification of multiplicative character sums due to Xu, and the resolution of the Vinogradov Mean Value Theorem in arbitrary dimensions.

math.NT↗
arXiv2021

On a conjecture for $\ell$-torsion in class groups of number fields: from the perspective of moments

It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the full strength of this conjecture remains open, and even partial progress is limited. Significant recent progress toward average versions of the $\ell$-torsion conjecture has crucially relied on counts for number fields, raising interest in how these two types of question relate. In this paper we make explicit the quantitative relationships between the $\ell$-torsion conjecture and other well-known conjectures: the Cohen-Lenstra heuristics, counts for number fields of fixed discriminant, counts for number fields of bounded discriminant (or related invariants), and counts for elliptic curves with fixed conductor. All of these considerations reinforce that we expect the $\ell$-torsion conjecture is true, despite limited progress toward it. Our perspective focuses on the relation between pointwise bounds, averages, and higher moments, and demonstrates the broad utility of the "method of moments."

math.NT↗
arXiv2021

On superorthogonality

In this survey, we explore how superorthogonality amongst functions in a sequence $f_1,f_2,f_3,\ldots$ results in direct or converse inequalities for an associated square function. We distinguish between three main types of superorthogonality, which we demonstrate arise in a wide array of settings in harmonic analysis and number theory. This perspective gives clean proofs of central results, and unifies topics including Khintchine's inequality, Walsh-Paley series, discrete operators, decoupling, counting solutions to systems of Diophantine equations, multicorrelation of trace functions, and the Burgess bound for short character sums.

math.CA↗
arXiv2020

On Bourgain's counterexample for the Schrödinger maximal function

This paper provides a rigorous derivation of a counterexample of Bourgain, related to a well-known question of pointwise a.e. convergence for the solution of the linear Schrödinger equation, for initial data in a Sobolev space. This counterexample combines ideas from analysis and number theory, and the present paper demonstrates how to build such counterexamples from first principles, and then optimize them.

math.CA↗