arXiv subjects

Alan Talmage

Publications and source records attributed to Alan Talmage.

3 recordsLinked to original sources

arXiv2022

Prime Solutions of Diagonal Diophantine Systems

An asymptotic formula for the number of prime solutions of a general diagonal system of Diophantine equations is established, contingent on the existence of an appropriate mean value bound and on local solvability. In conjunction with the Vinogradov Mean Value Theorem this yields an asymptotic formula for solutions of Vinogradov systems and in conjunction with Hooley's work on seven cubes this yields a conditional result for the Waring-Goldbach problem on seven cubes of primes, contingent on Hooley's form of the Riemann hypothesis.

math.NT↗

arXiv2019

Simultaneous Cubic and Quadratic Diagonal Equations In 12 Prime Variables

The system of equations \[ u_1p_1^2 + \ldots + u_sp_s^2 = 0 \] \[ v_1p_1^3 + \ldots + v_sp_s^3 = 0 \] has prime solutions $(p_1, \ldots, p_s)$ for $s \geq 12$, assuming that the system has solutions modulo each prime $p$. This is proved via the Hardy-Littlewood circle method, building on Wooley's work on the corresponding system over the integers and recent results on Vinogradov's mean value theorem. Additionally, a set of sufficient conditions for local solvability is given: If both equations are solvable modulo 2, the quadratic equation is solvable modulo 3, and for each prime $p$ at least 7 of each of the $u_i$, $v_i$ are not zero modulo $p$, then the system has solutions modulo each prime $p$.

math.NT↗

arXiv2014

Coefficients and roots of peak polynomials

Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define ${\mathcal{P}_S(n)=\{\pi\in \mathfrak{S}_n:P(\pi)=S\}}$. Billey-Burdzy-Sagan showed that for all fixed subsets of positive integers $S$ and sufficiently large $n$, $|\mathcal{P}_S(n)|=p_S(n)2^{n-|S|-1}$ for some polynomial $p_S(x)$ depending on $S$. They conjectured that the coefficients of $p_S(x)$ expanded in a binomial coefficient basis centered at $\max(S)$ are all positive. We show that this is a consequence of a stronger conjecture that bounds the modulus of the roots of $p_S(x)$. Furthermore, we give an efficient explicit formula for peak polynomials in the binomial basis centered at $0$, which we use to identify many integer roots of peak polynomials along with certain inequalities and identities.

math.CO↗