In this article, using an Halpern extragradient method, we study a new iterative scheme for finding a common element of the set of solutions of multiple set split equality equilibrium problems consisting of pseudomonotone bifunctions and the set of fixed points for two finite families of Bregman quasi-nonexpansive mappings in the framework of p-uniformly convex Banach spaces, which are also uniformly smooth. For this purpose, we design an algorithm so that it does not depend on prior estimates of the Lipschitz-type constants for the pseudomonotone bifunctions. Furthermore, we present an application of our study for finding a common element of the set of solutions of multiple set split equality variational inequality problems and fixed point sets for two finite families of Bregman quasi-nonexpansive mappings. Finally, we conclude with two numerical experiments to support our proposed algorithm.

Assume that f is a real ρ-harmonic function of the unit disk $\mathbb{D}$ onto the interval $(-1,1)$, where $\rho(u,v)=R(u)$ is a metric defined in the infinite strip $(-1,1)\times \mathbb{R}$. Then we prove that $|\nabla f(z)|(1-|z|^2)\le \frac{4}{\pi}(1-f(z)^2)$ for all $z\in\mathbb{D}$, provided that ρ has a non-negative Gaussian curvature. This extends several results in the field and answers to a conjecture proposed by the first author in 2014. Such an inequality is not true for negatively curved metrics.

The dynamics of interfaces in slow diffusion equations with strong absorption are studied. Asymptotic methods are used to give descriptions of the behaviour local to a comprehensive range of possible singular events that can occur in any evolution. These events are: when an interface changes its direction of propagation (reversing and anti-reversing), when an interface detaches from an absorbing obstacle (detaching), when two interfaces are formed by film rupture (touchdown) and when the solution undergoes extinction. Our account of extinction and self-similar reversing and anti-reversing is built upon previous work; results on non-self-similar reversing and anti-reversing and on the various types of detachment and touchdown are developed from scratch. In all cases, verification of the asymptotic results against numerical solutions to the full PDE is provided. Self-similar solutions, both of the full equation and of its asymptotic limits, play a central role in the analysis.

In this paper, we consider the dynamical behaviour of a reaction–diffusion model for a population residing in a one-dimensional habit, with emphasis on the effects of boundary conditions and protection zone. We assume that the population is subjected to a strong Allee effect in its natural domain but obeys a monostable nonlinear growth in the protection zone $[L_1,\, L_2]$ with two constants satisfying $0\leq L_1< L_2$, and the general Robin condition is imposed on $x=0$ (i.e. $u(t,\,0)=bu_x(t,\,0)$ with $b\geq 0$). We show the existence of two critical values $0< L_*\leq L^*$, and prove that a vanishing–transition–spreading trichotomy result holds when the length of protection zone is smaller than $L_*$; a transition–spreading dichotomy result holds when the length of protection zone is between $L_*$ and $L^*$; only spreading happens when the length of protection zone is larger than $L^*$. Based on the properties of $L_*$, we obtain the precise strategies for an optimal protection zone: if $b$ is large (i.e. $b\geq 1/\sqrt {-g'(0)}$), the protection zone should start from somewhere near $0$; while if $b$ is small (i.e. $b< 1/\sqrt {-g'(0)}$), then the protection zone should start from somewhere away from $0$, and as far away from $0$ as possible.

We construct an anticyclotomic Euler system for the Rankin–Selberg convolutions of two modular forms, using p-adic families of generalised Gross–Kudla–Schoen diagonal cycles. As applications of this construction, we prove new results on the Bloch–Kato conjecture in analytic ranks zero and one, and a divisibility towards an Iwasawa main conjecture.

We study the problem of finding the root vertex in large growing networks. We prove that it is possible to construct confidence sets of size independent of the number of vertices in the network that contain the root vertex with high probability in various models of random networks. The models include uniform random recursive dags and uniform Cooper-Frieze random graphs.