The point-line collinearity graph ${\mathcal{G}}$ of the maximal 2-local geometry for the largest simple Fischer group, $Fi_{24}^{\prime }$, is extensively analysed. For an arbitrary vertex $a$ of ${\mathcal{G}}$, the $i\text{th}$-disc of $a$ is described in detail. As a consequence, it follows that ${\mathcal{G}}$ has diameter $5$. The collapsed adjacency matrix of ${\mathcal{G}}$ is given as well as accompanying computer files which contain a wealth of data about ${\mathcal{G}}$.

Supplementary materials are available with this article.

In this paper we perform an extensive study of the spaces of automorphic forms for $\text{GL}_{2}$ of weight $2$ and level $\mathfrak{n}$, for $\mathfrak{n}$ an ideal in the ring of integers of the quartic CM field $\mathbb{Q}({\it\zeta}_{12})$ of twelfth roots of unity. This study is conducted through the computation of the Hecke module $H^{\ast }({\rm\Gamma}_{0}(\mathfrak{n}),\mathbb{C})$, and the corresponding Hecke action. Combining this Hecke data with the Faltings–Serre method for proving equivalence of Galois representations, we are able to provide the first known examples of modular elliptic curves over this field.

Supplementary materials are available with this article.

Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the ring learning with errors problem (ring-LWE) has become a popular building block for cryptographic primitives, due to its great versatility and its hardness proof consisting of a (quantum) reduction from ideal lattice problems. But, for a given modulus $q$ and degree $n$ number field $K$, generating ring-LWE samples can be perceived as cumbersome, because the secret keys have to be taken from the reduction mod $q$ of a certain fractional ideal ${\mathcal{O}}_{K}^{\vee }\subset K$ called the codifferent or ‘dual’, rather than from the ring of integers ${\mathcal{O}}_{K}$ itself. This has led to various non-dual variants of ring-LWE, in which one compensates for the non-duality by scaling up the errors. We give a comparison of these versions, and revisit some unfortunate choices that have been made in the recent literature, one of which is scaling up by ${|\unicode[STIX]{x1D6E5}_{K}|}^{1/2n}$ with $\unicode[STIX]{x1D6E5}_{K}$ the discriminant of $K$. As a main result, we provide, for any $\unicode[STIX]{x1D700}>0$, a family of number fields $K$ for which this variant of ring-LWE can be broken easily as soon as the errors are scaled up by ${|\unicode[STIX]{x1D6E5}_{K}|}^{(1-\unicode[STIX]{x1D700})/n}$.

We investigate the central moments of (regular) hexagons and derive accordingly a discrete approximation to definite integrals on hexagons. The seven-point cubature rule makes use of interior and neighbor center nodes, and is of fourth order by construction. The result is expected to be useful in two-dimensional (open-field) applications of integral equations or image processing.

Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving the SVP require space which (heuristically) grows as $2^{0.2075n+o(n)}$, where $n$ is the lattice dimension. In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration algorithms, despite their superior asymptotic time complexity.

We generalize sieving algorithms to solve SVP with less memory. We consider reductions of tuples of vectors rather than pairs of vectors as existing sieve algorithms do. For triples, we estimate that the space requirement scales as $2^{0.1887n+o(n)}$. The naive algorithm for this triple sieve runs in time $2^{0.5661n+o(n)}$. With appropriate filtering of pairs, we reduce the time complexity to $2^{0.4812n+o(n)}$ while keeping the same space complexity. We further analyze the effects of using larger tuples for reduction, and conjecture how this provides a continuous trade-off between the memory-intensive sieving and the asymptotically slower enumeration.

We outline an algorithm to compute $\unicode[STIX]{x1D703}(z,\unicode[STIX]{x1D70F})$ in genus two in quasi-linear time, borrowing ideas from the algorithm for theta constants and the one for $\unicode[STIX]{x1D703}(z,\unicode[STIX]{x1D70F})$ in genus one. Our implementation shows a large speed-up for precisions as low as a few thousand decimal digits. We also lay out a strategy to generalize this algorithm to genus $g$.

The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of pseudo-Frobenius numbers of a numerical semigroup and, if so, to compute the set of all numerical semigroups having this set as set of pseudo-Frobenius numbers.

Brauer classes of a global field can be represented by cyclic algebras. Effective constructions of such algebras and a maximal order therein are given for $\mathbb{F}_{q}(t)$, excluding cases of wild ramification. As part of the construction, we also obtain a new description of subfields of cyclotomic function fields.

There is always a natural embedding of $S_{s}\wr S_{k}$ into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to prove that in the $2$-level, strength-$1$ case the LP relaxation permutation symmetry group of this formulation is isomorphic to $S_{2}\wr S_{k}$ for all $k$, and in the $2$-level, strength-$2$ case it is isomorphic to $S_{2}^{k}\rtimes S_{k+1}$ for $k\geqslant 4$. The strength-$2$ result reveals previously unknown permutation symmetries that cannot be captured by the natural embedding of $S_{2}\wr S_{k}$. We also conjecture a complete characterization of the LP relaxation permutation symmetry group of the ILP formulation.

Supplementary materials are available with this article.

We propose an algorithm to verify the $p$-part of the class number for a number field $K$, provided $K$ is totally real and an abelian extension of the rational field $\mathbb{Q}$, and $p$ is any prime. On fields of degree 4 or higher, this algorithm has been shown heuristically to be faster than classical algorithms that compute the entire class number, with improvement increasing with larger field degrees.

For a $t$-nomial $f(x)=\sum _{i=1}^{t}c_{i}x^{a_{i}}\in \mathbb{F}_{q}[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2(q-1)^{1-\unicode[STIX]{x1D700}}C^{\unicode[STIX]{x1D700}}$, where $\unicode[STIX]{x1D700}=1/(t-1)$ and $C$ is the size of the largest coset in $\mathbb{F}_{q}^{\ast }$ on which $f$ vanishes completely. Additionally, we describe a number-theoretic parameter depending only on $q$ and the exponents $a_{i}$ which provides a general and easily computable upper bound for $C$. We thus obtain a strict improvement over an earlier bound of Canetti et al. which is related to the uniformity of the Diffie–Hellman distribution. Finally, we conjecture that $t$-nomials over prime fields have only $O(t\log p)$ roots in $\mathbb{F}_{p}^{\ast }$ when $C=1$.

We describe an implementation for computing holomorphic and skew-holomorphic Jacobi forms of integral weight and scalar index on the full modular group. This implementation is based on formulas derived by one of the authors which express Jacobi forms in terms of modular symbols of elliptic modular forms. Since this method allows a Jacobi eigenform to be generated directly from a given modular eigensymbol without reference to the whole ambient space of Jacobi forms, it makes it possible to compute Jacobi Hecke eigenforms of large index. We illustrate our method with several examples.

In this paper we describe methods for finding very small maximal subgroups of very large groups, with particular application to the subgroup 47:23 of the Baby Monster. This example is completely intractable by standard or naïve methods. The example of finding 31:15 inside the Thompson group $\text{Th}$ is also discussed as a test case.

Let $G$ be a simple simply connected exceptional algebraic group of type $G_{2}$, $F_{4}$, $E_{6}$ or $E_{7}$ over an algebraically closed field $k$ of characteristic $p>0$ with $\mathfrak{g}=\text{Lie}(G)$. For each nilpotent orbit $G\cdot e$ of $\mathfrak{g}$, we list the Jordan blocks of the action of $e$ on the minimal induced module $V_{\text{min}}$ of $\mathfrak{g}$. We also establish when the centralizers $G_{v}$ of vectors $v\in V_{\text{min}}$ and stabilizers $\text{Stab}_{G}\langle v\rangle$ of $1$-spaces $\langle v\rangle \subset V_{\text{min}}$ are smooth; that is, when $\dim G_{v}=\dim \mathfrak{g}_{v}$ or $\dim \text{Stab}_{G}\langle v\rangle =\dim \text{Stab}_{\mathfrak{g}}\langle v\rangle$.

Let $C/\mathbf{Q}$ be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of $\mathbf{Q}$, but may not have a hyperelliptic model of the usual form over $\mathbf{Q}$. We describe an algorithm that computes the local zeta functions of $C$ at all odd primes of good reduction up to a prescribed bound $N$. The algorithm relies on an adaptation of the ‘accumulating remainder tree’ to matrices with entries in a quadratic field. We report on an implementation and compare its performance to previous algorithms for the ordinary hyperelliptic case.

The Li coefficients $\unicode[STIX]{x1D706}_{F}(n)$ of a zeta or $L$ -function $F$ provide an equivalent criterion for the (generalized) Riemann hypothesis. In this paper we define these coefficients, and their generalizations, the $\unicode[STIX]{x1D70F}$ -Li coefficients, for a subclass of the extended Selberg class which is known to contain functions violating the Riemann hypothesis such as the Davenport–Heilbronn zeta function. The behavior of the $\unicode[STIX]{x1D70F}$ -Li coefficients varies depending on whether the function in question has any zeros in the half-plane $\text{Re}(z)>\unicode[STIX]{x1D70F}/2.$ We investigate analytically and numerically the behavior of these coefficients for such functions in both the $n$ and $\unicode[STIX]{x1D70F}$ aspects.

We describe the construction of a database of genus-$2$ curves of small discriminant that includes geometric and arithmetic invariants of each curve, its Jacobian, and the associated $L$-function. This data has been incorporated into the $L$-Functions and Modular Forms Database (LMFDB).

The aim of this paper is to find a formula for the double Laplace transform of the truncated variation of a Brownian motion with drift. In order to find the double Laplace transform, we also prove some identities for the Brownian motion with drift, which may be of independent interest.

Let $\mathbf{f}$ and $\mathbf{g}$ be polynomials of a bounded Euclidean norm in the ring $\mathbb{Z}[X]/\langle X^{n}+1\rangle$. Given the polynomial $[\mathbf{f}/\mathbf{g}]_{q}\in \mathbb{Z}_{q}[X]/\langle X^{n}+1\rangle$, the NTRU problem is to find $\mathbf{a},\mathbf{b}\in \mathbb{Z}[X]/\langle X^{n}+1\rangle$ with a small Euclidean norm such that $[\mathbf{a}/\mathbf{b}]_{q}=[\mathbf{f}/\mathbf{g}]_{q}$. We propose an algorithm to solve the NTRU problem, which runs in $2^{O(\log ^{2}\unicode[STIX]{x1D706})}$ time when $\Vert \mathbf{g}\Vert ,\Vert \mathbf{f}\Vert$, and $\Vert \mathbf{g}^{-1}\Vert$ are within some range. The main technique of our algorithm is the reduction of a problem on a field to one on a subfield. The GGH scheme, the first candidate of an (approximate) multilinear map, was recently found to be insecure by the Hu–Jia attack using low-level encodings of zero, but no polynomial-time attack was known without them. In the GGH scheme without low-level encodings of zero, our algorithm can be directly applied to attack this scheme if we have some top-level encodings of zero and a known pair of plaintext and ciphertext. Using our algorithm, we can construct a level-$0$ encoding of zero and utilize it to attack a security ground of this scheme in the quasi-polynomial time of its security parameter using the parameters suggested by Garg, Gentry and Halevi [‘Candidate multilinear maps from ideal lattices’, Advances in cryptology — EUROCRYPT 2013 (Springer, 2013) 1–17].

Consider two ordinary elliptic curves $E,E^{\prime }$ defined over a finite field $\mathbb{F}_{q}$, and suppose that there exists an isogeny $\unicode[STIX]{x1D713}$ between $E$ and $E^{\prime }$. We propose an algorithm that determines $\unicode[STIX]{x1D713}$ from the knowledge of $E$, $E^{\prime }$ and of its degree $r$, by using the structure of the $\ell$-torsion of the curves (where $\ell$ is a prime different from the characteristic $p$ of the base field). Our approach is inspired by a previous algorithm due to Couveignes, which involved computations using the $p$-torsion on the curves. The most refined version of that algorithm, due to De Feo, has a complexity of $\tilde{O} (r^{2})p^{O(1)}$ base field operations. On the other hand, the cost of our algorithm is $\tilde{O} (r^{2})\log (q)^{O(1)}$, for a large class of inputs; this makes it an interesting alternative for the medium- and large-characteristic cases.