Treatment for third-order nonlinear differential equations based on the Adomian decomposition method

The Adomian decomposition method (ADM) is an efficient method for solving linear and nonlinear ordinary differential equations, differential algebraic equations, partial differential equations, stochastic differential equations, and integral equations. Based on the ADM, a new analytical and numerical treatment is introduced in this research for third-order boundary-value problems. The effectiveness of the proposed approach is verified by numerical examples.

The Schwarzian equation for completely replicable functions

We describe the Schwarzian equations for the 328 completely replicable functions with integral$q$-coefficients [Fordet al., ‘More on replicable functions’,Comm. Algebra22 (1994) no. 13, 5175–5193].

A generalized scheme based on shifted Jacobi polynomials for numerical simulation of coupled systems of multi-term fractional-order partial differential equations

Due to the increasing application of fractional calculus in engineering and biomedical processes, we analyze a new method for the numerical simulation of a large class of coupled systems of fractional-order partial differential equations. In this paper, we study shifted Jacobi polynomials in the case of two variables and develop some new operational matrices of fractional-order integrations as well as fractional-order differentiations. By the use of these operational matrices, we present a new and easy method for solving a generalized class of coupled systems of fractional-order partial differential equations subject to some initial conditions. We convert the system under consideration to a system of easily solvable algebraic equation without discretizing the system, and obtain a highly accurate solution. Also, the proposed method is compared with some other well-known differential transform methods. The proposed method is computer oriented. We useMatLabto perform the necessary calculation. The next two parts will appear soon.

Real multiplication through explicit correspondences

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.

Point counting on K3 surfaces and an application concerning real and complex multiplication

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.

Computing -series of geometrically hyperelliptic curves of genus three

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.

On the minimal modules for exceptional Lie algebras: Jordan blocks and stabilizers

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$.

Structure of the maximal -local geometry point-line collinearity graph

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.

Computing theta functions in quasi-linear time in genus two and above

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$.