# Alex Rice

## Publications Authored By Alex Rice

In this paper we study the following multi-parameter variant of the celebrated Falconer distance problem. Given ${\textbf{d}}=(d_1,d_2, \dots, d_{\ell})\in \mathbb{N}^{\ell}$ with $d_1+d_2+\dots+d_{\ell}=d$ and $E \subseteq \mathbb{R}^d$, we define $$ \Delta_{{\textbf{d}}}(E) = \left\{ \left(|x^{(1)}-y^{(1)}|,\ldots,|x^{(\ell)}-y^{(\ell)}|\right) : x,y \in E \right\} \subseteq \mathbb{R}^{\ell}, $$ where for $x\in \mathbb{R}^d$ we write $x=\left( x^{(1)},\dots, x^{(\ell)} \right)$ with $x^{(i)} \in \mathbb{R}^{d_i}$. We ask how large does the Hausdorff dimension of $E$ need to be to ensure that the $\ell$-dimensional Lebesgue measure of $\Delta_{{\textbf{d}}}(E)$ is positive? We prove that if $2 \leq d_i$ for $1 \leq i \leq \ell$, then the conclusion holds provided $$ \dim(E)>d-\frac{\min d_i}{2}+\frac{1}{3}. Read More

We show that if $h\in \mathbb{Z}[x]$ is a polynomial of degree $k \geq 2$ such that $h(\mathbb{N})$ contains a multiple of $q$ for every $q\in \mathbb{N}$, known as an $\textit{intersective polynomial}$, then any subset of $\{1,2,\dots,N\}$ with no nonzero differences of the form $h(n)$ for $n\in\mathbb{N}$ has density at most a constant depending on $h$ times $(\log N)^{-c\log\log\log\log N}$, where $c=(2\log k)^{-1}$. Bounds of this type were previously known only for monomials and intersective quadratics, and this is currently the best-known bound for the original Furstenberg-S\'ark\"ozy Theorem, i.e. Read More

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in \mathbb{Z}[x]$ lie in in the classes of so-called intersective and $\mathcal{P}$-intersective polynomials, respectively. For example, we show that a subset of $\{1,2,\dots,N\}$ free of nonzero differences of the form $n^j+m^k$ for fixed $j,k\in \mathbb{N}$ has density at most $e^{-(\log N)^{\mu}}$ for some $\mu=\mu(j,k)>0$. Our results, obtained by adapting two Fourier analytic, circle method-driven strategies, either recover or improve upon all previous results for a single polynomial. Read More

In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a consequence of this result for polynomials structures in sumsets and limitations of the method. Read More

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The prime variant can be interpreted as a multi-dimensional, polynomial extension of Linnik's Theorem. This version is a revision of the published version. Read More

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation. Read More

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term. Read More

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we establish a quantitative estimate on the size of the largest subset of ${1,2,\dots,N}$ which lacks the desired arithmetic structure, showing that if deg$(h)=k$, then the density of such a set is at most a constant times $(\log N)^{-c}$ for any $c<1/(2k-2)$. We also discuss how an improved version of this result for $k=2$ and a relative version in the primes can be obtained with some additional known methods. Read More

We extend the best known bound on the largest subset of {1,2,... Read More

**Category:**Mathematics - Number Theory

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences are replaced with any integer linear combination of two primes. Read More