### Browse by

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.

### Recent Submissions

• #### L1 scheme for solving an inverse problem subject to a fractional diffusion equation

This 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 { z ∈ C ∖ { 0 } : | Arg z | < θ } 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.
• #### Higher moments for the Stochastic Cahn - Hilliard Equation with multiplicative Fourier noise

We consider in dimensions $d=1,2,3$ the $\eps$-dependent stochastic Cahn-Hilliard 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 non-layered 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$d-moment 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 time-fractional Klein-Gordon equation on an unbounded domain using artificial boundary conditions

A finite difference method for time-fractional Klein-Gordon 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 time-fractional Klein-Gordon equation on an unbounded domain.

• #### Correction of High-Order Lk Approximation for Subdiffusion

The subdiffusion equations with a Caputo fractional derivative of order $\alpha \in (0, 1)$ arise in a wide variety of practical problems, which describe the transport processes, in the force-free limit, slower than Brownian diffusion. In this work, we derive the correction schemes of the Lagrange interpolation with degree $k ( \leq 6)$ convolution quadrature, called $L_{k}$ approximation, for the subdiffusion. The key step of designing correction algorithm is to calculate the explicit form of the coefficients of $L_{k}$ approximation by the polylogarithm function or Bose-Einstein integral. To construct a $\tau_{8}$ approximation of Bose-Einstein integral, the desired $(k+1-\alpha)$th-order convergence rate can be proved for the correction $L_{k}$ scheme with nonsmooth data, which is higher than kth-order BDFk method in [Jin, Li, and Zhou, SIAM J. Sci. Comput., 39 (2017), A3129–A3152; Shi and Chen, J. Sci. Comput., (2020) 85:28]. The numerical experiments with spectral method are given to illustrate theoretical results.
• #### Detailed Error Analysis for a Fractional Adams Method on Caputo--Hadamard Fractional Differential Equations

We consider a predictor--corrector numerical method for solving Caputo--Hadamard fractional differential equation over the uniform mesh $\log t_{j} = \log a + \big ( \log \frac{t_{N}}{a} \big ) \big ( \frac{j}{N} \big ), \, j=0, 1, 2, \dots, N$~with $a \geq 1$, where $\log a = \log t_{0} < \log t_{1} < \dots < \log t_{N}= \log T$ is a partition of $[\log a, \log T]$. The error estimates under the different smoothness properties of the solution $y$ and the nonlinear function $f$ are studied. Numerical examples are given to verify that the numerical results are consistent with the theoretical results.
• #### DNA codes from skew dihedral group ring

In this work, we present a matrix construction for reversible codes derived from skew dihedral group rings. By employing this matrix construction, the ring {F}_{j, k} and its associated Gray maps, we show how one can construct reversible codes of length n2^{j+k} over the finite field {F}_4. As an application, we construct a number of DNA codes that satisfy the Hamming distance, the reverse, the reverse-complement, and the GC-content constraints with better parameters than some good DNA codes in the literature.
• #### Miyamoto groups of code algebras

A code algebra A_C is a nonassociative commutative algebra defined via a binary linear code C. In a previous paper, we classified when code algebras are Z_2-graded axial (decomposition) algebras generated by small idempotents. In this paper, for each algebra in our classification, we obtain the Miyamoto group associated to the grading. We also show that the code algebra structure can be recovered from the axial decomposition algebra structure.
• #### Split spin factor algebras

Motivated by Yabe's classification of symmetric $2$-generated axial algebras of Monster type \cite{yabe}, we introduce a large class of algebras of Monster type $(\alpha, \frac{1}{2})$, generalising Yabe's $\mathrm{III}(\alpha,\frac{1}{2}, \delta)$ family. Our algebras bear a striking similarity with Jordan spin factor algebras with the difference being that we asymmetrically split the identity as a sum of two idempotents. We investigate the properties of these algebras, including the existence of a Frobenius form and ideals. In the $2$-generated case, where our algebra is isomorphic to one of Yabe's examples, we use our new viewpoint to identify the axet, that is, the closure of the two generating axes.
• #### Enumerating 3-generated axial algebras of Monster type

An axial algebra is a commutative non-associative algebra generated by axes, that is, primitive, semisimple idempotents whose eigenvectors multiply according to a certain fusion law. The Griess algebra, whose automorphism group is the Monster, is an example of an axial algebra. We say an axial algebra is of Monster type if it has the same fusion law as the Griess algebra. The 2-generated axial algebras of Monster type, called Norton-Sakuma algebras, have been fully classified and are one of nine isomorphism types. In this paper, we enumerate a subclass of 3-generated axial algebras of Monster type in terms of their groups and shapes. It turns out that the vast majority of the possible shapes for such algebras collapse; that is they do not lead to non-trivial examples. This is in sharp contrast to previous thinking. Accordingly, we develop a method of minimal forbidden configurations, to allow us to efficiently recognise and eliminate collapsing shapes.
• #### Group LCD and group reversible LCD codes

In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the n × n matrices to obtain LCD codes. Our construction method guarantees that our LCD codes are also group codes, namely, the codes are ideals in a group ring. We show that with a certain condition on the group ring element v, one can construct non-trivial group LCD codes. Moreover, we also show that by adding more constraints on the group ring element v, one can construct group LCD codes that are reversible. We present many examples of binary group LCD codes of which some are optimal and group reversible LCD codes with different parameters.
• #### Binary self-dual and LCD codes from generator matrices constructed from two group ring elements by a heuristic search scheme

&lt;p style='text-indent:20px;'&gt;We present a generator matrix of the form &lt;inline-formula&gt;&lt;tex-math id="M1"&gt;\begin{document}$[ \sigma(v_1) \ | \ \sigma(v_2)]$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;, where &lt;inline-formula&gt;&lt;tex-math id="M2"&gt;\begin{document}$v_1 \in RG$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; and &lt;inline-formula&gt;&lt;tex-math id="M3"&gt;\begin{document}$v_2\in RH$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;, for finite groups &lt;inline-formula&gt;&lt;tex-math id="M4"&gt;\begin{document}$G$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; and &lt;inline-formula&gt;&lt;tex-math id="M5"&gt;\begin{document}$H$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; of order &lt;inline-formula&gt;&lt;tex-math id="M6"&gt;\begin{document}$n$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; for constructing self-dual codes and linear complementary dual codes over the finite Frobenius ring &lt;inline-formula&gt;&lt;tex-math id="M7"&gt;\begin{document}$R$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;. In general, many of the constructions to produce self-dual codes forces the code to be an ideal in a group ring which implies that the code has a rich automorphism group. Unlike the traditional cases, codes constructed from the generator matrix presented here are not ideals in a group ring, which enables us to find self-dual and linear complementary dual codes that are not found using more traditional techniques. In addition to that, by using this construction, we improve &lt;inline-formula&gt;&lt;tex-math id="M8"&gt;\begin{document}$10$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; of the previously known lower bounds on the largest minimum weights of binary linear complementary dual codes for some lengths and dimensions. We also obtain &lt;inline-formula&gt;&lt;tex-math id="M9"&gt;\begin{document}$82$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; new binary linear complementary dual codes, &lt;inline-formula&gt;&lt;tex-math id="M10"&gt;\begin{document}$50$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; of which are either optimal or near optimal of lengths &lt;inline-formula&gt;&lt;tex-math id="M11"&gt;\begin{document}$41 \leq n \leq 61$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; which are new to the literature.&lt;/p&gt;
• #### Weak convergence of the L1 scheme for a stochastic subdiffusion problem driven by fractionally integrated additive noise

The weak convergence of a fully discrete scheme for approximating a stochastic subdiffusion problem driven by fractionally integrated additive noise is studied. The Caputo fractional derivative is approximated by the L1 scheme and the Riemann-Liouville fractional integral is approximated with the first order convolution quadrature formula. The noise is discretized by using the Euler method and the spatial derivative is approximated with the linear finite element method. Based on the nonsmooth data error estimates of the corresponding deterministic problem, the weak convergence orders of the fully discrete schemes for approximating the stochastic subdiffusion problem driven by fractionally integrated additive noise are proved by using the Kolmogorov equation approach. Numerical experiments are given to show that the numerical results are consistent with the theoretical results.
• #### Numerical methods for Caputo-Hadamard fractional differential equations with graded and non-uniform meshes

We consider the predictor-corrector numerical methods for solving Caputo-Hadamard fractional differential equation with the graded meshes $\log t_{j} = \log a + \big ( \log \frac{t_{N}}{a} \big ) \big ( \frac{j}{N} \big )^{r}, \, j=0, 1, 2, \dots, N$ with $a \geq 1$ and $r \geq 1$, where $\log a = \log t_{0} < \log t_{1} < \dots < \log t_{N}= \log T$ is a partition of $[\log t_{0}, \log T]$. We also consider the rectangular and trapezoidal methods for solving Caputo-Hadamard fractional differential equation with the non-uniform meshes $\log t_{j} = \log a + \big ( \log \frac{t_{N}}{a} \big ) \frac{j (j+1)}{N(N+1)}, \, j=0, 1, 2, \dots, N$. Under the weak smoothness assumptions of the Caputo-Hadamard fractional derivative, e.g., $\prescript{}{CH}D^\alpha_{a,t}y(t) \notin C^{1}[a, T]$ with $\alpha \in (0, 2)$, the optimal convergence orders of the proposed numerical methods are obtained by choosing the suitable graded mesh ratio $r \geq 1$. The numerical examples are given to show that the numerical results are consistent with the theoretical findings.
• #### A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes

In this paper, a genetic algorithm, one of the evolutionary algorithm optimization methods, is used for the first time for the problem of computing extremal binary self-dual codes. We present a comparison of the computational times between the genetic algorithm and a linear search for different size search spaces and show that the genetic algorithm is capable of computing binary self-dual codes significantly faster than the linear search. Moreover, by employing a known matrix construction together with the genetic algorithm, we are able to obtain new binary self-dual codes of lengths 68 and 72 in a significantly short time. In particular, we obtain 11 new binary self-dual codes of length 68 and 17 new binary self-dual codes of length 72.
• #### New type I binary $[72, 36, 12]$ self-dual codes from $M_6(\mathbb{F}_2)G$ - Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm

In this paper, a new search technique based on a virus optimisation algorithm is proposed for calculating the neighbours of binary self-dual codes. The aim of this new technique is to calculate neighbours of self-dual codes without reducing the search field in the search process (this technique is known in the literature due to the computational time constraint) but still obtaining results in a reasonable time (significantly faster when compared to the standard linear computational search). We employ this new search algorithm to the well-known neighbour method and its extension, the $k^{th}$ range neighbours, and search for binary $[72, 36, 12]$ self-dual codes. In particular, we present six generator matrices of the form $[I_{36} \ | \ \tau_6(v)],$ where $I_{36}$ is the $36 \times 36$ identity matrix, $v$ is an element in the group matrix ring $M_6(\mathbb{F}_2)G$ and $G$ is a finite group of order 6, to which we employ the proposed algorithm and search for binary $[72, 36, 12]$ self-dual codes directly over the finite field $\mathbb{F}_2$. We construct 1471 new Type I binary $[72, 36, 12]$ self-dual codes with the rare parameters $\gamma = 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 32$\ in their weight enumerators.
• #### Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours

&lt;p style='text-indent:20px;'&gt;In this work, we define a modification of a bordered construction for self-dual codes which utilises &lt;inline-formula&gt;&lt;tex-math id="M1"&gt;\begin{document}$\lambda$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative Frobenius rings of characteristic 2. Using the modified construction together with the neighbour construction, we construct many binary self-dual codes of lengths 54, 68, 82 and 94 with weight enumerators that have previously not been known to exist.&lt;/p&gt;
• #### Isotopic signatures of methane emissions from tropical fires, agriculture and wetlands: the MOYA and ZWAMPS flights

We report methane isotopologue data from aircraft and ground measurements in Africa and South America. Aircraft campaigns sampled strong methane fluxes over tropical papyrus wetlands in the Nile, Congo and Zambezi basins, herbaceous wetlands in Bolivian southern Amazonia, and over fires in African woodland, cropland and savannah grassland. Measured methane δ13CCH4 isotopic signatures were in the range −55 to −49‰ for emissions from equatorial Nile wetlands and agricultural areas, but widely −60 ± 1‰ from Upper Congo and Zambezi wetlands. Very similar δ13CCH4 signatures were measured over the Amazonian wetlands of NE Bolivia (around −59‰) and the overall δ13CCH4 signature from outer tropical wetlands in the southern Upper Congo and Upper Amazon drainage plotted together was −59 ± 2‰. These results were more negative than expected. For African cattle, δ13CCH4 values were around −60 to −50‰. Isotopic ratios in methane emitted by tropical fires depended on the C3 : C4 ratio of the biomass fuel. In smoke from tropical C3 dry forest fires in Senegal, δ13CCH4 values were around −28‰. By contrast, African C4 tropical grass fire δ13CCH4 values were −16 to −12‰. Methane from urban landfills in Zambia and Zimbabwe, which have frequent waste fires, had δ13CCH4 around −37 to −36‰. These new isotopic values help improve isotopic constraints on global methane budget models because atmospheric δ13CCH4 values predicted by global atmospheric models are highly sensitive to the δ13CCH4 isotopic signatures applied to tropical wetland emissions. Field and aircraft campaigns also observed widespread regional smoke pollution over Africa, in both the wet and dry seasons, and large urban pollution plumes. The work highlights the need to understand tropical greenhouse gas emissions in order to meet the goals of the UNFCCC Paris Agreement, and to help reduce air pollution over wide regions of Africa. This article is part of a discussion meeting issue 'Rising methane: is warming feeding warming? (part 2)'.
• #### A Novel Averaging Principle Provides Insights in the Impact of Intratumoral Heterogeneity on Tumor Progression

Typically stochastic differential equations (SDEs) involve an additive or multiplicative noise term. Here, we are interested in stochastic differential equations for which the white noise is nonlinearly integrated into the corresponding evolution term, typically termed as random ordinary differential equations (RODEs). The classical averaging methods fail to treat such RODEs. Therefore, we introduce a novel averaging method appropriate to be applied to a specific class of RODEs. To exemplify the importance of our method, we apply it to an important biomedical problem, in particular, we implement the method to the assessment of intratumoral heterogeneity impact on tumor dynamics. Precisely, we model gliomas according to a well-known Go or Grow (GoG) model, and tumor heterogeneity is modeled as a stochastic process. It has been shown that the corresponding deterministic GoG model exhibits an emerging Allee effect (bistability). In contrast, we analytically and computationally show that the introduction of white noise, as a model of intratumoral heterogeneity, leads to monostable tumor growth. This monostability behavior is also derived even when spatial cell diffusion is taken into account.
• #### Oscillatory and stability of a mixed type difference equation with variable coefficients

The goal of this paper is to study the oscillatory and stability of the mixed type difference equation with variable coefficients $\Delta x(n)=\sum_{i=1}^{\ell}p_{i}(n)x(\tau_{i}(n))+\sum_{j=1}^{m}q_{j}(n)x(\sigma_{i}(n)),\quad n\ge n_{0},$ where $\tau_{i}(n)$ is the delay term and $\sigma_{j}(n)$ is the advance term and they are positive real sequences for $i=1,\cdots,l$ and $j=1,\cdots,m$, respectively, and $p_{i}(n)$ and $q_{j}(n)$ are real functions. This paper generalise some known results and the examples illustrate the results.