We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We obtain a new sum–product estimate in prime fields for sets of large cardinality. In particular, we show that if $A\subseteq \mathbb{F}_{p}$ satisfies $|A|\leq p^{64/117}$ then $\max \{|A\pm A|,|AA|\}\gtrsim |A|^{39/32}.$ Our argument builds on and improves some recent results of Shakan and Shkredov [‘Breaking the 6/5 threshold for sums and products modulo a prime’, Preprint, 2018, arXiv:1806.07091v1] which use the eigenvalue method to reduce to estimating a fourth moment energy and the additive energy $E^{+}(P)$ of some subset $P\subseteq A+A$. Our main novelty comes from reducing the estimation of $E^{+}(P)$ to a point–plane incidence bound of Rudnev [‘On the number of incidences between points and planes in three dimensions’, Combinatorica38(1) (2017), 219–254] rather than a point–line incidence bound used by Shakan and Shkredov.
Let $K$ be a field that admits a cyclic Galois extension of degree $n\geq 2$. The symmetric group $S_{n}$ acts on $K^{n}$ by permutation of coordinates. Given a subgroup $G$ of $S_{n}$ and $u\in K^{n}$, let $V_{G}(u)$ be the $K$-vector space spanned by the orbit of $u$ under the action of $G$. In this paper we show that, for a special family of groups $G$ of affine type, the dimension of $V_{G}(u)$ can be computed via the greatest common divisor of certain polynomials in $K[x]$. We present some applications of our results to the cases $K=\mathbb{Q}$ and $K$ finite.
We present the geometry behind counting twin prime polynomials in $\mathbb{F}_{q}[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties for cubic twin prime polynomials. The elliptic curve $X^{3}=Y(Y-1)$ occurs in the geometry, and thus counting cubic twin prime polynomials involves the associated modular form. In theory, this approach can be extended to higher degree twin primes, but the computations become harder.
The formula we get in degree 3 is compatible with the Hardy–Littlewood heuristic on average, agrees with the prediction for $q\equiv 2$ (mod 3), but shows anomalies for $q\equiv 1$ (mod 3).
We prove a function field analogue of Maynard’s celebrated result about primes with restricted digits. That is, for certain ranges of parameters $n$ and $q$, we prove an asymptotic formula for the number of irreducible polynomials of degree $n$ over a finite field $\mathbb{F}_{q}$ whose coefficients are restricted to lie in a given subset of $\mathbb{F}_{q}$.
We discuss 1-factorizations of complete graphs that “match” a given Hadamard matrix. We prove the existence of these factorizations for two families of Hadamard matrices: Walsh matrices and certain Paley matrices.
We obtain a non-trivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short intervals, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However, the underlying technique is different and allows us to obtain non-trivial results starting from much shorter ranges.
for an additive character $\unicode[STIX]{x1D712}$ over $\mathbb{F}_{q}$ and a polynomial $Q\in \mathbb{F}_{q}[x_{0},\ldots ,x_{n-1}]$ of degree at most 2 in the coefficients $x_{0},\ldots ,x_{n-1}$ of $f=\sum _{i<n}x_{i}t^{i}$. As in the integers, it is reasonable to expect that, due to the random-like behaviour of $\unicode[STIX]{x1D707}$, such sums should exhibit considerable cancellation. In this paper we show that the correlation (1) is bounded by $O_{\unicode[STIX]{x1D716}}(q^{(-1/4+\unicode[STIX]{x1D716})n})$ for any $\unicode[STIX]{x1D716}>0$ if $Q$ is linear and $O(q^{-n^{c}})$ for some absolute constant $c>0$ if $Q$ is quadratic. The latter bound may be reduced to $O(q^{-c^{\prime }n})$ for some $c^{\prime }>0$ when $Q(f)$ is a linear form in the coefficients of $f^{2}$, that is, a Hankel quadratic form, whereas, for general quadratic forms, it relies on a bilinear version of the additive-combinatorial Bogolyubov theorem.
We improve some previously known deterministic algorithms for finding integer solutions $x,y$ to the exponential equation of the form $af^{x}+bg^{y}=c$ over finite fields.
The cardinality of the set of $D\leqslant x$ for which the fundamental solution of the Pell equation $t^{2}-Du^{2}=1$ is less than $D^{1/2+\unicode[STIX]{x1D6FC}}$ with $\unicode[STIX]{x1D6FC}\in [\frac{1}{2},1]$ is studied and certain lower bounds are obtained, improving previous results of Fouvry by introducing the $q$-analogue of van der Corput method to algebraic exponential sums with smooth moduli.
In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as ‘Birch sums’. Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the distribution of large values of this maximum, that hold in a wide uniform range. This improves a recent result of Kowalski and Sawin. The proofs use a blend of probabilistic methods, harmonic analysis techniques, and deep tools from algebraic geometry. The results can also be generalized to other types of $\ell$-adic trace functions. In particular, the lower bound of our result also holds for partial sums of Kloosterman sums. As an application, we show that there exist $x\in [1,p]$ and $a\in \mathbb{F}_{p}^{\times }$ such that $|\sum _{n\leqslant x}\exp (2\unicode[STIX]{x1D70B}i(n^{3}+an)/p)|\geqslant (2/\unicode[STIX]{x1D70B}+o(1))\sqrt{p}\log \log p$. The uniformity of our results suggests that this bound is optimal, up to the value of the constant.
We prove the reciprocity law for the twisted second moments of Dirichlet $L$-functions over rational function fields, corresponding to
two irreducible polynomials. This formula is the analogue of the formulas
for Dirichlet $L$-functions over $\mathbb{Q}$ obtained by Conrey [‘The mean-square of Dirichlet $L$-functions’, arXiv:0708.2699 [math.NT] (2007)] and Young [‘The reciprocity law
for the twisted second moment of Dirichlet $L$-functions’, Forum Math.
23(6) (2011), 1323–1337].
We upper-bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from Gröbner basis theory known as footprint. Then we establish and prove extensions in this context of a family of well-known results in algebra and combinatorics. These include Alon's combinatorial Nullstellensatz [1], existence and uniqueness of Hermite interpolating polynomials over a grid, estimations of the parameters of evaluation codes with consecutive derivatives [20], and bounds on the number of zeros of a polynomial by DeMillo and Lipton [8], Schwartz [25], Zippel [26, 27] and Alon and Füredi [2]. As an alternative, we also extend the Schwartz-Zippel bound to weighted multiplicities and discuss its connection to our extension of the footprint bound.
In this paper, we prove some conjectures of K. Stolarsky concerning the first and third moments of the Beatty sequences with the golden section and its square.
A 1993 result of Alon and Füredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to polynomials over an arbitrary commutative ring, assuming a certain ‘Condition (D)’ on the grid which holds vacuously when the ring is a domain. In the first half of this paper we give a further generalized Alon–Füredi theorem which provides a sharp upper bound when the degrees of the polynomial in each variable are also taken into account. This yields in particular a new proof of Alon–Füredi. We then discuss the relationship between Alon–Füredi and results of DeMillo–Lipton, Schwartz and Zippel. A direct coding theoretic interpretation of Alon–Füredi theorem and its generalization in terms of Reed–Muller-type affine variety codes is shown, which gives us the minimum Hamming distance of these codes. Then we apply the Alon–Füredi theorem to quickly recover – and sometimes strengthen – old and new results in finite geometry, including the Jamison–Brouwer–Schrijver bound on affine blocking sets. We end with a discussion of multiplicity enhancements.
We formulate some conjectures about the precise determination of the monodromy groups of certain rigid local systems on $\mathbb{A}^{1}$ whose monodromy groups are known, by results of Kubert, to be finite. We prove some of them.
We prove that the exponent of distribution of $\unicode[STIX]{x1D70F}_{3}$ in arithmetic progressions can be as large as $\frac{1}{2}+\frac{1}{34}$, provided that the moduli is squarefree and has only sufficiently small prime factors. The tools involve arithmetic exponent pairs for algebraic trace functions, as well as a double $q$-analogue of the van der Corput method for smooth bilinear forms.
We show, under some natural restrictions, that orbits of polynomials cannot contain too many elements of small multiplicative order modulo a large prime p. We also show that for all but finitely many initial points either the multiplicative order of this point or the length of the orbit it generates (both modulo a large prime p) is large. The approach is based on the results of Dvornicich and Zannier (Duke Math. J.139 (2007), 527–554) and Ostafe (2017) on roots of unity in polynomial orbits over the algebraic closure of the field of rational numbers.
The fractional derivatives include nonlocal information and thus their calculation requires huge storage and computational cost for long time simulations. We present an efficient and high-order accurate numerical formula to speed up the evaluation of the Caputo fractional derivative based on the L2-1σ formula proposed in [A. Alikhanov, J. Comput. Phys., 280 (2015), pp. 424-438], and employing the sum-of-exponentials approximation to the kernel function appeared in the Caputo fractional derivative. Both theoretically and numerically, we prove that while applied to solving time fractional diffusion equations, our scheme not only has unconditional stability and high accuracy but also reduces the storage and computational cost.
For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX^{2}+c$, starting at $0$, always recurs after $O(q/\text{log}\log q)$ steps. For $X^{2}+1$, the same is true for any starting value. We suggest that the traditional “birthday paradox” model is inappropriate for iterates of $X^{3}+c$, when $q$ is 2 mod 3.
We improve a recent result of B. Hanson [Estimates for character sums with various convolutions. Preprint, 2015, arXiv:1509.04354] on multiplicative character sums with expressions of the type $a+b+cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a+b(c+d)$. Our new bounds rely on some recent advances in additive combinatorics.