Mathematics
We are an active university Mathematics Department with a strong teaching and research reputation. We offer students the chance to study at undergraduate or postgraduate level on degree programmes leading to: BSc in Mathematics, BSc/BA joint courses in Mathematics or Applied Statistics and a wide range of other subjects. We have an active research group focusing on Computational Applied Mathematics, with research students studying for the degrees of MPhil and PhD, postdoctoral workers and associated collaborators from across the world.
This collection is licenced under a Creative Commons licence. The collection may be reproduced for noncommerical use and without modification, providing that copyright is acknowledged.
Recent Submissions

Codes over a ring of order 32 with two Gray mapsWe describe a ring of order 32 and prove that it is a local Frobenius ring. We study codes over this ring and we give two distinct nonequivalent linear orthogonalitypreserving Gray maps to the binary space. Selfdual codes are studied over this ring as well as the binary selfdual codes that are the Gray images of those codes. Specifically, we show that the image of a selfdual code over this ring is a binary selfdual code with an automorphism consisting of 2n transpositions for the first map and n transpositions for the second map. We relate the shadows of binary codes to additive codes over the ring. As Gray images of codes over the ring, binary selfdual [ 70 , 35 , 12 ] codes with 91 distinct weight enumerators are constructed for the first time in the literature.

Numerical Approximation for a Stochastic Fractional Differential Equation Driven by Integrated Multiplicative NoiseWe consider a numerical approximation for stochastic fractional differential equations driven by integrated multiplicative noise. The fractional derivative is in the Caputo sense with the fractional order α∈(0,1), and the nonlinear terms satisfy the global Lipschitz conditions. We first approximate the noise with the piecewise constant function to obtain the regularized stochastic fractional differential equation. By applying Minkowski’s inequality for double integrals, we establish that the error between the exact solution and the solution of the regularized problem has an order of O(Δtα) in the mean square norm, where Δt denotes the step size. To validate our theoretical conclusions, numerical examples are presented, demonstrating the consistency of the numerical results with the established theory.

BDF2 ADI orthogonal spline collocation method for the fractional integrodifferential equations of parabolic type in three dimensionsIn this paper, we are concerned with constructing a fast and an efficient alternating direction implicit (ADI) scheme for the fractional parabolic integrodifferential equations (FPIDE) with a weakly singular kernel in three dimensions (3D). Our constructed scheme is based on a secondorder backward differentiation formula (BDF2) for temporal discretization, orthogonal spline collocation (OSC) method for spatial discretization and a secondorder fractional quadrature rule proposed by Lubich for the RiemannLiouville fractional integral. The stability and convergence of the constructed numerical scheme are derived. Finally, some numerical examples are given to illustrate the accuracy and validity of the BDF2 ADI OSC method. Based on the obtained results, the numerical results are in line with the theoretical ones.

Spatial discretization for stochastic semilinear superdiffusion driven by fractionally integrated multiplicative spacetime white noiseWe investigate the spatial discretization of a stochastic semilinear superdiffusion problem driven by fractionally integrated multiplicative spacetime white noise. The white noise is characterized by its properties of being white in both space and time and the time fractional derivative is considered in the Caputo sense with an order $\alpha \in (1, 2)$. A spatial discretization scheme is introduced by approximating the spacetime white noise with the Euler method in the spatial direction and approximating the secondorder space derivative with the central difference scheme. By using the Green functions, we obtain both exact and approximate solutions for the proposed problem. The regularities of both the exact and approximate solutions are studied and the optimal error estimates that depend on the smoothness of the initial values are established. This paper builds upon the research presented in Mathematics. 2021. 9, 1917, where we originally focused on error estimates in the context of subdiffusion with $\alpha \in (0, 1)$. We extend our investigation to the spatial approximation of stochastic superdiffusion with $\alpha \in (1, 2)$ and place particular emphasis on refining our understanding of the superdiffusion phenomenon by analyzing the error estimates associated with the time derivative at the initial point.

Highorder schemes based on extrapolation for semilinear fractional differential equationBy rewriting the Riemann–Liouville fractional derivative as Hadamard finitepart integral and with the help of piecewise quadratic interpolation polynomial approximations, a numerical scheme is developed for approximating the Riemann–Liouville fractional derivative of order α∈(1, 2). The error has the asymptotic expansion (d3τ3α+d4τ4α+d5τ5α+⋯)+(d2∗τ4+d3∗τ6+d4∗τ8+⋯) at any fixed time tN=T, N∈Z+, where di, i=3, 4, … and di∗, i=2, 3, … denote some suitable constants and τ=T/N denotes the step size. Based on this discretization, a new scheme for approximating the linear fractional differential equation of order α∈(1, 2) is derived and its error is shown to have a similar asymptotic expansion. As a consequence, a highorder scheme for approximating the linear fractional differential equation is obtained by extrapolation. Further, a highorder scheme for approximating a semilinear fractional differential equation is introduced and analyzed. Several numerical experiments are conducted to show that the numerical results are consistent with our theoretical findings.

Unconditionally stable and convergent difference scheme for superdiffusion with extrapolationApproximating the Hadamard finitepart integral by the quadratic interpolation polynomials, we obtain a scheme for approximating the RiemannLiouville fractional derivative of order α∈(1, 2) and the error is shown to have the asymptotic expansion (d3τ3α+d4τ4α+d5τ5α+⋯)+(d2∗τ4+d3∗τ6+d4∗τ8+⋯) at any fixed time, where τ denotes the step size and dl, l=3, 4, ⋯ and dl∗, l=2, 3, ⋯ are some suitable constants. Applying the proposed scheme in temporal direction and the central difference scheme in spatial direction, a new finite difference method is developed for approximating the time fractional wave equation. The proposed method is unconditionally stable, convergent with order O(τ3α), α∈(1, 2) and the error has the asymptotic expansion. Richardson extrapolation is applied to improve the accuracy of the numerical method. The convergence orders are O(τ4α) and O(τ2(3α)), α∈(1, 2), respectively, after first two extrapolations. Numerical examples are presented to show that the numerical results are consistent with the theoretical findings.

Quotients of the Highwater algebra and its coverPrimitive axial algebras of Monster type are a class of nonassociative algebras with a strong link to finite (especially simple) groups. The motivating example is the Griess algebra, with the Monster as its automorphism group. A crucial step towards the understanding of such algebras is the explicit description of the 2generated symmetric objects. Recent work of Yabe, and Franchi and Mainardis shows that any such algebra is either explicitly known, or is a quotient of the infinitedimensional Highwater algebra H, or its characteristic 5 cover Ĥ. In this paper, we complete the classification of symmetric axial algebras of Monster type by determining the quotients of H and Ĥ. We proceed in a unified way, by defining a cover of H in all characteristics. This cover has a previously unseen fusion law and provides an insight into why the Highwater algebra has a cover which is of Monster type only in characteristic 5.

The weight enumerators of singlyeven selfdual [88,44,14] codes and new binary selfdual [68,34,12] and [88,44,14] codesIn this work, we focus on constructing binary selfdual [68, 34, 12] and [88, 44, 14] codes with new parameters in their weight enumerators. For this purpose, we present a new bordered matrix construction for selfdual codes which is derived as a modification of two known bordered matrix constructions. We provide the necessary conditions for the new construction to produce selfdual codes over finite commutative Frobenius rings of characteristic 2. We also construct the possible weight enumerators for singlyeven selfdual [88, 44, 14] codes and their shadows as this has not been done in the literature yet. We employ the modified bordered matrix together with the wellknown neighbour method to construct binary selfdual codes that could not be obtained from the other, known bordered matrix constructions. Many of the codes turn out to have parameters in their weight enumerators that were not known in the literature before.

Strong approximation of stochastic semilinear subdiffusion and superdiffusion driven by fractionally integrated additive noiseRecently, Kovács et al. considered a Mittag‐Leffler Euler integrator for a stochastic semilinear Volterra integral‐differential equation with additive noise and proved the strong convergence error estimates [see SIAM J. Numer. Anal. 58(1) 2020, pp. 66‐85]. In this article, we shall consider the Mittag‐Leffler integrators for more general models: stochastic semilinear subdiffusion and superdiffusion driven by fractionally integrated additive noise. The mild solutions of our models involve four different Mittag‐Leffler functions. We first consider the existence, uniqueness and the regularities of the solutions. We then introduce the full discretization schemes for solving the problems. The temporal discretization is based on the Mittag‐Leffler integrators and the spatial discretization is based on the spectral method. The optimal strong convergence error estimates are proved under the reasonable assumptions for the semilinear term and for the regularity of the noise. Numerical examples are given to show that the numerical results are consistent with the theoretical results.

High Order Approximations of Solutions to Initial Value Problems for Linear Fractional IntegroDifferential EquationsWe consider a general class of linear integrodifferential equations with Caputo fractional derivatives and weakly singular kernels. First, the underlying initial value problem is reformulated as an integral equation and the possible singular behavior of its exact solution is determined. After that, using a suitable smoothing transformation and spline collocation techniques, the numerical solution of the problem is discussed. Optimal convergence estimates are derived and a superconvergence result of the proposed method is established. The obtained theoretical results are supported by numerical experiments.

A posteriori error analysis of spacetime discontinuous Galerkin methods for the εstochastic AllenCahn equationIn this work, we apply an \textit{a posteriori} error analysis for the spacetime, discontinuous in time, Galerkin scheme which has been proposed in \cite{AIMA} for the $\eps$dependent stochastic AllenCahn equation with mild noise $\dot{W}^\eps$ tending to rough as $\eps\rightarrow 0$. Our results are derived under low regularity since the noise even smooth in space, is assumed only onetime continuously differentiable in time, according to the minimum regularity properties of \cite{Fun99}. We prove \textit{a posteriori} error estimates for the $m$dimensional problem, $m\leq 4$ for a general class of spacetime finite element spaces. The \textit{a posteriori} bound is growing only polynomially in $\eps^{1}$ if the step length $h$ is bounded by a positive power of $\eps$. This agrees with the restriction posed so far in the \textit{a priori} error analysis of continuous finite element schemes for the $\eps$dependent deterministic AllenCahn or deterministic and stochastic CahnHilliard equation. As an application we examine tensorial elements where the discrete solution is approximated by polynomial functions of separated space and time variables; the \textit{a posteriori} estimates there involve dimensions, and the space, time discretization parameters. We then consider the special case of the mild noise $\dot{W}^\eps$ as defined in \cite{weber1} through the convolution of a Gaussian process with a proper mollifying kernel, which is then numerically constructed. Finally, we provide some useful insights for the numerical algorithm, and present for the first time some numerical experiments of the scheme for both one and twodimensional problems in various cases of interest, and compare with the deterministic ones.

Galerkin Finite Element Approximation of a Stochastic Semilinear Fractional Wave Equation Driven by Fractionally Integrated Additive NoiseWe investigate the application of the Galerkin finite element method to approximate a stochastic semilinear space–time fractional wave equation. The equation is driven by integrated additive noise, and the time fractional order α∈(1, 2). The existence of a unique solution of the problem is proved by using the Banach fixed point theorem, and the spatial and temporal regularities of the solution are established. The noise is approximated with the piecewise constant function in time in order to obtain a stochastic regularized semilinear space–time wave equation which is then approximated using the Galerkin finite element method. The optimal error estimates are proved based on the various smoothing properties of the Mittag–Leffler functions. Numerical examples are provided to demonstrate the consistency between the theoretical findings and the obtained numerical results.

MutationBased Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear CodesFinding the minimum distance of linear codes is a nondeterministic polynomialtimehard problem and different approaches are used in the literature to solve this problem. Although, some of the methods focus on finding the true distances by using exact algorithms, some of them focus on optimization algorithms to find the lower or upper bounds of the distance. In this study, we focus on the latter approach. We first give the swarm intelligence background of artificial bee colony algorithm, we explain the algebraic approach of such algorithm and call it the algebraic artificial bee colony algorithm (AABC). Moreover, we develop the AABC algorithm by integrating it with the algebraic differential mutation operator. We call the developed algorithm the mutationbased algebraic artificial bee colony algorithm (MBAABC). We apply both; the AABC and MBAABC algorithms to the problem of finding the minimum distance of linear codes. The achieved results indicate that the MBAABC algorithm has a superior performance when compared with the AABC algorithm when finding the minimum distance of Bose, Chaudhuri, and Hocquenghem (BCH) codes (a special type of linear codes).

From forbidden configurations to a classification of some axial algebras of Monster typeIvanov introduced the shape of a Majorana algebra as a record of the 2generated subalgebras arising in that algebra. As a broad generalisation of this concept and to free it from the ambient algebra, we introduce the concept of an axet and shapes on an axet. A shape can be viewed as an algebra version of a group amalgam. Just like an amalgam, a shape leads to a unique algebra completion which may be nontrivial or it may collapse. Then for a natural family of shapes of generalised Monster type we classify all completion algebras and discover that a great majority of them collapse, confirming the observations made in an earlier paper [12].

L1 scheme for solving an inverse problem subject to a fractional diffusion equationThis paper considers the temporal discretization of an inverse problem subject to a time fractional diffusion equation. Firstly, the convergence of the L1 scheme is established with an arbitrary sectorial operator of spectral angle < 𝜋∕2, that is the resolvent set of this operator contains {𝑧 ∈ ℂ ⧵ {0} ∶ Arg 𝑧 < 𝜃} for some 𝜋∕2 < 𝜃 < 𝜋. The relationship between the time fractional order 𝛼 ∈ (0, 1) and the constants in the error estimates is precisely characterized, revealing that the L1 scheme is robust as 𝛼 approaches 1. Then an inverse problem of a fractional diffusion equation is analyzed, and the convergence analysis of a temporal discretization of this inverse problem is given. Finally, numerical results are provided to confirm the theoretical results.

Group matrix ring codes and constructions of selfdual codesIn this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring Mk(R) and the ring R, where R is the commutative Frobenius ring. We show that codes over the ring Mk(R) are one sided ideals in the group matrix ring Mk(R)G and the corresponding codes over the ring R are Gkcodes of length kn. Additionally, we give a generator matrix for selfdual codes, which consist of the mentioned above matrix construction. We employ this generator matrix to search for binary selfdual codes with parameters [72, 36, 12] and find new singlyeven and doublyeven codes of this type. In particular, we construct 16 new Type I and 4 new Type II binary [72, 36, 12] selfdual codes.

Higher moments for the Stochastic Cahn  Hilliard Equation with multiplicative Fourier noiseWe consider in dimensions $d=1,2,3$ the $\eps$dependent stochastic CahnHilliard equation with a multiplicative and sufficiently regular in space infinite dimensional Fourier noise with strength of order $\mathcal{O}(\eps^\gamma)$, $\gamma>0$. The initial condition is nonlayered and independent from $\eps$. Under general assumptions on the noise diffusion $\sigma$, we prove moment estimates in $H^1$ (and in $L^\infty$ when $d=1$). Higher $H^2$ regularity $p$moment estimates are derived when $\sigma$ is bounded, yielding as well space H\"older and $L^\infty$ bounds for $d=2,3$, and path a.s. continuity in space. All appearing constants are expressed in terms of the small positive parameter $\eps$. As in the deterministic case, in $H^1$, $H^2$, the bounds admit a negative polynomial order in $\eps$. Finally, assuming layered initial data of initial energy uniformly bounded in $\eps$, as proposed by X.F. Chen in \cite{chenjdg}, we use our $H^1$ $2$dmoment estimate and prove the stochastic solution's convergence to $\pm 1$ as $\eps\rightarrow 0$ a.s., when the noise diffusion has a linear growth.

Finite difference method for timefractional KleinGordon equation on an unbounded domain using artificial boundary conditionsA finite difference method for timefractional KleinGordon equation with the fractional order $\alpha \in (1, 2]$ on an unbounded domain is studied. The artificial boundary conditions involving the generalized Caputo derivative are derived using the Laplace transform technique. Stability and error estimates of the proposed finite difference scheme are proved in detail by using the discrete energy method. Numerical examples show that the artificial boundary method is a robust and efficient method for solving the timefractional KleinGordon equation on an unbounded domain.

Construction of DNA Codes from Composite Matrices and a BioInspired Optimization AlgorithmIn this work, we present a new construction method for reversible codes. We employ composite matrices derived from group rings and show how to construct these matrices so that they are also reversible. Also in this work, we give an algorithm for calculating conflict free DNA codes that satisfy the Hamming distance, the reverse, the reversecomplement, the GCcontent constraints with each DNA codeword being free from reverse complement substrings. By employing our construction method for reversible codes and our algorithm, we construct a number of DNA codes that satisfy the above constraints. Many of the codes we obtain have better parameters than some known DNA codes and many have parameters that are new to the literature.