arXiv subjects

Kirsti D. Biggs

Publications and source records attributed to Kirsti D. Biggs.

4 recordsLinked to original sources

arXiv2026

Reinforcing a Philosophy: A counting approach to square functions over local fields

In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,ϕ(T))$ where $ϕ(T)$ is a polynomial of degree at least 2. This includes new estimates for such curves given by monomials $ϕ(T) = T^k$ for $k \geq 3$ which are uniform over all local fields whose characteristic is coprime to $k$. Key to our approach is a systematic analysis of the second order differencing polynomial and its geometry in local fields.

math.CA↗

arXiv2023

Efficient congruencing in ellipsephic sets: the general case

In this paper, we bound the number of solutions to a general Vinogradov system of equations $x_1^j+\dots+x_s^j=y_1^j+\dots+y_s^j$, $(1\leq j\leq k)$, as well as other related systems, in which the variables are required to satisfy digital restrictions in a given base. Specifically, our sets of permitted digits have the property that there are few representations of a natural number as sums of elements of the digit set -- the set of squares serving as a key example. We obtain better bounds using this additive structure than could be deduced purely from the size of the set of variables. In particular, when the digits are required to be squares, we obtain diagonal behaviour with $2k(k+1)$ variables.

math.NT↗

arXiv2023

Efficient congruencing in ellipsephic sets: the quadratic case

In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in which the variables are required to satisfy digital restrictions in a given base. Certain sets of permitted digits, namely those giving rise to few representations of natural numbers as sums of elements of the digit set, allow us to obtain better bounds than would be possible using the size of the set alone.

math.NT↗

arXiv2023

A minimalist version of the circle method and Diophantine problems over thin sets

This paper studies the minimal conditions under which we can establish asymptotic formulae for Waring's problem and other additive problems that may be tackled by the circle method. We confirm in quantitative terms the well-known heuristic that a mean value estimate and an estimate of Weyl type, together with suitable distribution properties of the underlying set over a set of admissible residue classes, are sufficient to implement the circle method. This allows us to give a rather general proof of Waring's problem which is applicable to a range of sufficiently well-behaved thin sets, such as the ellipsephic sets recently investigated by the first author.

math.NT↗