We compute the complete set of candidates for the zeta function of a K$3$ surface over $\mathbb{F}_{2}$ consistent with the Weil and Tate conjectures, as well as the complete set of zeta functions of smooth quartic surfaces over $\mathbb{F}_{2}$. These sets differ substantially, but we do identify natural subsets which coincide. This gives some numerical evidence towards a Honda–Tate theorem for transcendental zeta functions of K$3$ surfaces; such a result would refine a recent theorem of Taelman, in which one must allow an uncontrolled base field extension.

The aim of the discrete logarithm problem with auxiliary inputs is to solve for ${\it\alpha}$, given the elements $g,g^{{\it\alpha}},\ldots ,g^{{\it\alpha}^{d}}$ of a cyclic group $G=\langle g\rangle$, of prime order $p$. The best-known algorithm, proposed by Cheon in 2006, solves for ${\it\alpha}$ in the case where $d\mid (p\pm 1)$, with a running time of $O(\sqrt{p/d}+d^{i})$ group exponentiations ($i=1$ or $1/2$ depending on the sign). There have been several attempts to generalize this algorithm to the case of ${\rm\Phi}_{k}(p)$ where $k\geqslant 3$. However, it has been shown by Kim, Cheon and Lee that a better complexity cannot be achieved than that of the usual square root algorithms.

We propose a new algorithm for solving the DLPwAI. We show that this algorithm has a running time of $\widetilde{O}(\sqrt{p/{\it\tau}_{f}}+d)$ group exponentiations, where ${\it\tau}_{f}$ is the number of absolutely irreducible factors of $f(x)-f(y)$. We note that this number is always smaller than $\widetilde{O}(p^{1/2})$.

In addition, we present an analysis of a non-uniform birthday problem.

Let $UY_{n}(q)$ be a Sylow $p$-subgroup of an untwisted Chevalley group $Y_{n}(q)$ of rank $n$ defined over $\mathbb{F}_{q}$ where $q$ is a power of a prime $p$. We partition the set $\text{Irr}(UY_{n}(q))$ of irreducible characters of $UY_{n}(q)$ into families indexed by antichains of positive roots of the root system of type $Y_{n}$. We focus our attention on the families of characters of $UY_{n}(q)$ which are indexed by antichains of length $1$. Then for each positive root $\unicode[STIX]{x1D6FC}$ we establish a one-to-one correspondence between the minimal degree members of the family indexed by $\unicode[STIX]{x1D6FC}$ and the linear characters of a certain subquotient $\overline{T}_{\unicode[STIX]{x1D6FC}}$ of $UY_{n}(q)$. For $Y_{n}=A_{n}$ our single root character construction recovers, among other things, the elementary supercharacters of these groups. Most importantly, though, this paper lays the groundwork for our classification of the elements of $\text{Irr}(UE_{i}(q))$, $6\leqslant i\leqslant 8$, and $\text{Irr}(UF_{4}(q))$.

We report on our project to find explicit examples of K3 surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for point counting on surfaces defined over finite fields. For this, we describe algorithms that are $p$-adic in nature.

We prove that every integer $n\geqslant 10$ such that $n\not \equiv 1\text{ mod }4$ can be written as the sum of the square of a prime and a square-free number. This makes explicit a theorem of Erdős that every sufficiently large integer of this type may be written in such a way. Our proof requires us to construct new explicit results for primes in arithmetic progressions. As such, we use the second author’s numerical computation regarding the generalised Riemann hypothesis to extend the explicit bounds of Ramaré–Rumely.

There are a number of fundamental results in the study of holomorphic function theory associated to the discrete group $\operatorname{PSL}(2,\mathbb{Z})$, including the following statements: the ring of holomorphic modular forms is generated by the holomorphic Eisenstein series of weights four and six, denoted by $E_{4}$ and $E_{6}$; the smallest-weight cusp form $\unicode[STIX]{x1D6E5}$ has weight twelve and can be written as a polynomial in $E_{4}$ and $E_{6}$; and the Hauptmodul $j$ can be written as a multiple of $E_{4}^{3}$ divided by $\unicode[STIX]{x1D6E5}$. The goal of the present article is to seek generalizations of these results to some other genus-zero arithmetic groups $\unicode[STIX]{x1D6E4}_{0}(N)^{+}$ with square-free level $N$, which are related to ‘Monstrous moonshine conjectures’. Certain aspects of our results are generated from extensive computer analysis; as a result, many of the space-consuming results are made available on a publicly accessible web site. However, we do present in this article specific results for certain low-level groups.

Inspired by methods of N. P. Smart, we describe an algorithm to determine all Picard curves over $\mathbb{Q}$ with good reduction away from 3, up to $\mathbb{Q}$-isomorphism. A correspondence between the isomorphism classes of such curves and certain quintic binary forms possessing a rational linear factor is established. An exhaustive list of integral models is determined and an application to a question of Ihara is discussed.

We compute equations for real multiplication on the divisor classes of genus-2 curves via algebraic correspondences. We do so by implementing van Wamelen’s method for computing equations for endomorphisms of Jacobians on examples drawn from the algebraic models for Hilbert modular surfaces computed by Elkies and Kumar. We also compute a correspondence over the universal family for the Hilbert modular surface of discriminant $5$ and use our equations to prove a conjecture of A. Wright on dynamics over the moduli space of Riemann surfaces.

In recent years, Com–Poisson has emerged as one of the most popular discrete models in the analysis of count data owing to its flexibility in handling different types of dispersion. However, in a stationary longitudinal Com–Poisson count data set-up where the covariates are time independent, estimation of regression and dispersion parameters based on a generalized quasi-likelihood (GQL) approach involves some major computational difficulties particularly in the inversion of the joint covariance matrix. On the other hand, in practical real-life longitudinal studies, time-dependent covariates leading to non-stationary responses are more frequently encountered. This implies that further computational problems will now arise when estimating parameters under non-stationary set-ups. This paper overcomes this problem by approximating the inverse of the ill-conditioned covariance matrix in the GQL approach through a multidimensional conjugate gradient method. The performance of this novel version of the GQL approach is then assessed on simulations of AR(1) stationary and AR(1) non-stationary longitudinal Com–Poisson counts and on real-life epileptic seizure counts. However, there is not yet an algorithm to generate non-stationary longitudinal Com–Poisson counts nor a GQL algorithm to estimate the parameters under non-stationary set-ups. Thus, the paper also provides a framework to generate non-stationary AR(1) Com–Poisson counts along with the construction of a GQL equation under non-stationary set-ups.

NTRU is a public-key cryptosystem introduced at ANTS-III. The two most used techniques in attacking the NTRU private key are meet-in-the-middle attacks and lattice-basis reduction attacks. Howgrave-Graham combined both techniques in 2007 and pointed out that the largest obstacle to attacks is the memory capacity that is required for the meet-in-the-middle phase. In the present paper an algorithm is presented that applies low-memory techniques to find ‘golden’ collisions to Odlyzko’s meet-in-the-middle attack against the NTRU private key. Several aspects of NTRU secret keys and the algorithm are analysed. The running time of the algorithm with a maximum storage capacity of $w$ is estimated and experimentally verified. Experiments indicate that decreasing the storage capacity $w$ by a factor $1<c<\sqrt{w}$ increases the running time by a factor $\sqrt{c}$.

This article considers the positive integers $N$ for which ${\it\zeta}_{N}(s)=\sum _{n=1}^{N}n^{-s}$ has zeroes in the half-plane $\Re (s)>1$. Building on earlier results, we show that there are no zeroes for $1\leqslant N\leqslant 18$ and for $N=20,21,28$. For all other $N$ there are infinitely many such zeroes.

If $S$ is a quintic surface in $\mathbb{P}^{3}$ with singular set 15 3-divisible ordinary cusps, then there is a Galois triple cover ${\it\phi}:X\rightarrow S$ branched only at the cusps such that $p_{g}(X)=4$, $q(X)=0$, $K_{X}^{2}=15$ and ${\it\phi}$ is the canonical map of $X$. We use computer algebra to search for such quintics having a free action of $\mathbb{Z}_{5}$, so that $X/\mathbb{Z}_{5}$ is a smooth minimal surface of general type with $p_{g}=0$ and $K^{2}=3$. We find two different quintics, one of which is the van der Geer–Zagier quintic; the other is new.

We also construct a quintic threefold passing through the 15 singular lines of the Igusa quartic, with 15 cuspidal lines there. By taking tangent hyperplane sections, we compute quintic surfaces with singular sets $17\mathsf{A}_{2}$, $16\mathsf{A}_{2}$, $15\mathsf{A}_{2}+\mathsf{A}_{3}$ and $15\mathsf{A}_{2}+\mathsf{D}_{4}$.

The security of several homomorphic encryption schemes depends on the hardness of variants of the approximate common divisor (ACD) problem. We survey and compare a number of lattice-based algorithms for the ACD problem, with particular attention to some very recently proposed variants of the ACD problem. One of our main goals is to compare the multivariate polynomial approach with other methods. We find that the multivariate polynomial approach is not better than the orthogonal lattice algorithm for practical cryptanalysis.

We also briefly discuss a sample-amplification technique for ACD samples and a pre-processing algorithm similar to the Blum–Kalai–Wasserman algorithm for learning parity with noise. The details of this work are given in the full version of the paper.

We consider a smooth system of two homogeneous quadratic equations over $\mathbb{Q}$ in $n\geqslant 13$ variables. In this case, the Hasse principle is known to hold, thanks to the work of Mordell in 1959. The only local obstruction is over $\mathbb{R}$. In this paper, we give an explicit algorithm to decide whether a nonzero rational solution exists and, if so, compute one.

We consider plane Cremona maps with proper base points and the base ideal generated by the linear system of forms defining the map. The object of this work is to study the link between the algebraic properties of the base ideal and those of the ideal of these points fattened by the virtual multiplicities arising from the linear system. We reveal conditions which naturally regulate this association, with particular emphasis on the homological side. While most classical numerical inequalities concern the three highest virtual multiplicities, here we emphasize also the role of one single highest multiplicity. In this vein we describe classes of Cremona maps for large and small values of the highest virtual multiplicity. We also deal with the delicate question as to when is the base ideal non-saturated and consider the structure of its saturation.

We present JKL-ECM, an implementation of the elliptic curve method of integer factorization which uses certain twisted Hessian curves in a family studied by Jeon, Kim and Lee. This implementation takes advantage of torsion subgroup injection for families of elliptic curves over a quartic number field, in addition to the ‘small parameter’ speedup. We produced thousands of curves with torsion $\mathbb{Z}/6\mathbb{Z}\oplus \mathbb{Z}/6\mathbb{Z}$ and small parameters in twisted Hessian form, which admit curve arithmetic that is ‘almost’ as fast as that of twisted Edwards form. This allows JKL-ECM to compete with GMP-ECM for finding large prime factors. Also, JKL-ECM, based on GMP, accepts integers of arbitrary size. We classify the torsion subgroups of Hessian curves over $\mathbb{Q}$ and further examine torsion properties of the curves described by Jeon, Kim and Lee. In addition, the high-performance curves with torsion $\mathbb{Z}/2\mathbb{Z}\oplus \mathbb{Z}/8\mathbb{Z}$ of Bernstein et al. are completely recovered by the $\mathbb{Z}/4\mathbb{Z}\oplus \mathbb{Z}/8\mathbb{Z}$ family of Jeon, Kim and Lee, and hundreds more curves are produced besides, all with small parameters and base points.

We study cup products in the integral cohomology of the Hilbert scheme of $n$ points on a K3 surface and present a computer program for this purpose. In particular, we deal with the question of which classes can be represented by products of lower degrees.

Supplementary materials are available with this article.

Consider the first-order retarded differential equation

$$\begin{eqnarray}x^{\prime }(t)+p(t)x({\it\tau}(t))=0,\quad t\geqslant t_{0},\end{eqnarray}$$

$p(t)\geqslant 0$

${\it\tau}(t)$

${\it\tau}(t)\leqslant t$

$t\geqslant t_{0}$

$\lim _{t\rightarrow \infty }{\it\tau}(t)=\infty$

$\liminf$

$$\begin{eqnarray}\liminf _{t\rightarrow \infty }\int _{{\it\tau}(t)}^{t}p(s)\,ds>\frac{1}{e}\end{eqnarray}$$

We study the elliptic curves in Cremona’s tables that are predicted by the Birch–Swinnerton-Dyer conjecture to have elements of order $7$ in their Tate–Shafarevich group. We show that in many cases these elements are visible in an abelian surface or abelian 3-fold.

We present a specialized point-counting algorithm for a class of elliptic curves over $\mathbb{F}_{p^{2}}$ that includes reductions of quadratic $\mathbb{Q}$-curves modulo inert primes and, more generally, any elliptic curve over $\mathbb{F}_{p^{2}}$ with a low-degree isogeny to its Galois conjugate curve. These curves have interesting cryptographic applications. Our algorithm is a variant of the Schoof–Elkies–Atkin (SEA) algorithm, but with a new, lower-degree endomorphism in place of Frobenius. While it has the same asymptotic asymptotic complexity as SEA, our algorithm is much faster in practice.