A comprehensive new perturbation theorem is posed and proven to estimate the magnitudes of roots of polynomials. The theorem successfully determines the magnitudes of roots for arbitrary degree of polynomial equations with no restrictions on the coefficients. In the previous papers ‘Pakdemirli and Elmas, Appl. Math. Comput. 216 (2010) 1645–1651’ and ‘Pakdemirli and Yurtsever, Appl. Math. Comput. 188 (2007) 2025–2028’, the given theorems were valid only for some restricted coefficients. The given theorem in this work is a generalization and unification of the past theorems and valid for arbitrary coefficients. Numerical applications of the theorem are presented as examples. It is shown that the theorem produces good estimates for the magnitudes of roots of polynomial equations of arbitrary order and unrestricted coefficients.

Using the cohomology theory of Dwork, as developed by Adolphson and Sperber, we exhibit a deterministic algorithm to compute the zeta function of a nondegenerate hypersurface defined over a finite field. This algorithm is particularly well suited to work with polynomials in small characteristic that have few monomials (relative to their dimension). Our method covers toric, affine, and projective hypersurfaces, and also can be used to compute the L-function of an exponential sum.

We give a natural geometric condition that ensures that sequences of interpolation polynomials (of fixed degree) of sufficiently differentiable functions with respect to the natural lattices introduced by Chung and Yao converge to a Taylor polynomial.

We characterize nonempty open subsets of the complex plane where the sum $\zeta (s, \alpha )+ {e}^{\pm i\pi s} \hspace{0.167em} \zeta (s, 1- \alpha )$ of Hurwitz zeta functions has no zeros in $s$ for all $0\leq \alpha \leq 1$. This problem is motivated by the construction of fundamental cardinal splines of complex order $s$.

Using the paths of steepest descent, we prove precise bounds with numerical implied constants for the modified Bessel function ${K}_{ir} (x)$ of imaginary order and its first two derivatives with respect to the order. We also prove precise asymptotic bounds on more general (mixed) derivatives without working out numerical implied constants. Moreover, we present an absolutely and rapidly convergent series for the computation of ${K}_{ir} (x)$ and its derivatives, as well as a formula based on Fourier interpolation for computing with many values of $r$. Finally, we have implemented a subset of these features in a software library for fast and rigorous computation of ${K}_{ir} (x)$.

We exhibit seven linear codes exceeding the current best known minimum distance $d$ for their dimension $k$ and block length $n$. Each code is defined over ${ \mathbb{F} }_{8} $, and their invariants $[n, k, d] $ are given by $[49, 13, 27] $, $[49, 14, 26] $, $[49, 16, 24] $, $[49, 17, 23] $, $[49, 19, 21] $, $[49, 25, 16] $ and $[49, 26, 15] $. Our method includes an exhaustive search of all monomial evaluation codes generated by points in the $[0, 5] \times [0, 5] $ lattice square.

In this article we show that the Czech mathematician Václav Šimerka discovered the factorization of $\frac{1}{9} (1{0}^{17} - 1)$ using a method based on the class group of binary quadratic forms more than 120 years before Shanks and Schnorr developed similar algorithms. Šimerka also gave the first examples of what later became known as Carmichael numbers.

For each solvable Galois group which appears in degree $9$ and each allowable signature, we find polynomials which define the fields of minimum absolute discriminant.

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $ \mathcal{O} $ be the valuation ring, $\mathfrak{m}$ the maximal ideal and $F(x)\in \mathcal{O} [x] $ a monic separable polynomial of degree $n$. Let $\delta = v(\mathrm{Disc} (F))$. The Montes algorithm computes an OM factorization of $F$. The single-factor lifting algorithm derives from this data a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$, for a prescribed precision $\nu $. In this paper we find a new estimate for the complexity of the Montes algorithm, leading to an estimation of $O({n}^{2+ \epsilon } + {n}^{1+ \epsilon } {\delta }^{2+ \epsilon } + {n}^{2} {\nu }^{1+ \epsilon } )$ word operations for the complexity of the computation of a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$, assuming that the residue field of $k$ is small.

We give an enumeration of all positive definite primitive $ \mathbb{Z} $-lattices in dimension $n\geq 3$ whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith–Minkowski–Siegel mass formula to computationally construct the square-free determinant lattices with this property, and then repeatedly calculating pre-images under a mapping first introduced by G. L. Watson.

We hereby complete the classification of single-class genera in dimensions 4 and 5 and correct some mistakes in Watson’s classifications in other dimensions. A list of all single-class primitive $ \mathbb{Z} $-lattices has been compiled and incorporated into the Catalogue of Lattices.

In this paper, we present the outcome of vast computer calculations, locating several of the very rare instances of level one cuspidal Bianchi modular forms that are not lifts of elliptic modular forms.

We present an algorithm for computing Borcherds products, which has polynomial runtime. It deals efficiently with the bounds on Fourier expansion indices originating in Weyl chambers. Naive multiplication has exponential runtime due to inefficient handling of these bounds. An implementation of the new algorithm shows that it is also much faster in practice.

For a given cusp form $\phi $ of even integral weight satisfying certain hypotheses, Waldspurger’s theorem relates the critical value of the $\mathrm{L} $-function of the $n\mathrm{th} $ quadratic twist of $\phi $ to the $n\mathrm{th} $ coefficient of a certain modular form of half-integral weight. Waldspurger’s recipes for these modular forms of half-integral weight are far from being explicit. In particular, they are expressed in the language of automorphic representations and Hecke characters. We translate these recipes into congruence conditions involving easily computable values of Dirichlet characters. We illustrate the practicality of our ‘simplified Waldspurger’ by giving several examples.

We describe an algorithm for enumerating the set of level one systems of Hecke eigenvalues arising from modular forms (mod $p$).

Supplementary materials are available with this article.

We consider the 33 conjugacy classes of genus zero, torsion-free modular subgroups, computing ramification data and Grothendieck’s dessins d’enfants. In the particular case of the index 36 subgroups, the corresponding Calabi–Yau threefolds are identified, in analogy with the index 24 cases being associated to K3 surfaces. In a parallel vein, we study the 112 semi-stable elliptic fibrations over ${ \mathbb{P} }^{1} $ as extremal K3 surfaces with six singular fibres. In each case, a representative of the corresponding class of subgroups is identified by specifying a generating set for that representative.

In this paper we study the weak approximation problem of $E[\phi (x(T))] $ by $E[\phi (y(T))] $, where $x(T)$ is the solution of a stochastic differential delay equation and $y(T)$ is defined by the Euler scheme. For $\phi \in { C}_{b}^{3} $, Buckwar, Kuske, Mohammed and Shardlow (‘Weak convergence of the Euler scheme for stochastic differential delay equations’, LMS J. Comput. Math. 11 (2008) 60–69) have shown that the Euler scheme has weak order of convergence $1$. Here we prove that the same results hold when $\phi $ is only assumed to be measurable and bounded under an additional non-degeneracy condition.

Denote by $ \mathbb{Q} ( \sqrt{- m} )$, with $m$ a square-free positive integer, an imaginary quadratic number field, and by ${ \mathcal{O} }_{- m} $ its ring of integers. The Bianchi groups are the groups ${\mathrm{SL} }_{2} ({ \mathcal{O} }_{- m} )$. In the literature, so far there have been no examples of $p$-torsion in the integral homology of the full Bianchi groups, for $p$ a prime greater than the order of elements of finite order in the Bianchi group, which is at most 6. However, extending the scope of the computations, we can observe examples of torsion in the integral homology of the quotient space, at prime numbers as high as for instance $p= 80\hspace{0.167em} 737$ at the discriminant $- 1747$.

Supplementary materials are available with this article.

In the original article [LMS J. Comput. Math. 15 (2012) 71–83], the authors use a discrete form of the Itô formula, developed by Appleby, Berkolaiko and Rodkina [Stochastics 81 (2009) no. 2, 99–127], to show that the almost sure asymptotic stability of a particular two-dimensional test system is preserved when the discretisation step size is small. In this Corrigendum, we identify an implicit assumption in the original proof of the discrete Itô formula that, left unaddressed, would preclude its application to the test system of interest. We resolve this problem by reproving the relevant part of the discrete Itô formula in such a way that confirms its applicability to our test equation. Thus, we reaffirm the main results and conclusions of the original article.

The purpose of this paper is twofold. We present first a vanishing theorem for families of linear series with base ideal being a fat points ideal. We then apply this result in order to give a partial proof of a conjecture raised by Bocci, Harbourne and Huneke concerning containment relations between ordinary and symbolic powers of planar point ideals.

In this paper we deal with the operators

$$\begin{eqnarray*}{Z}_{n} (f; x)= \frac{n}{{b}_{n} } { \mathop{\sum }\nolimits}_{k= 0}^{n} {p}_{n, k} \biggl(\frac{x}{{b}_{n} } \biggr)\int \nolimits \nolimits_{0}^{\infty } {s}_{n, k} \biggl(\frac{t}{{b}_{n} } \biggr)f(t)\hspace{0.167em} dt, \quad 0\leq x\leq {b}_{n}\end{eqnarray*}$$

${p}_{n, k} (u)=\bigl(\hspace{-4pt}{\scriptsize \begin{array}{ l} \displaystyle n\\ \displaystyle k\end{array} } \hspace{-4pt}\bigr){u}^{k} \mathop{(1- u)}\nolimits ^{n- k} , (0\leq k\leq n), u\in [0, 1] $

${s}_{n, k} (u)= {e}^{- nu} \mathop{(nu)}\nolimits ^{k} \hspace{-3pt}/ k!, u\in [0, \infty )$