We consider frieze sequences corresponding to sequences of cluster mutations for affine D- and E-type quivers. We show that the cluster variables satisfy linear recurrences with periodic coefficients, which imply the constant coefficient relations found by Keller and Scherotzke. Viewing the frieze sequence as a discrete dynamical system, we reduce it to a symplectic map on a lower dimensional space and prove Liouville integrability of the latter.

We consider the focussing fractional periodic Korteweg–deVries (fKdV) and fractional periodic non-linear Schrödinger equations (fNLS) equations, with L2 sub-critical dispersion. In particular, this covers the case of the periodic KdV and Benjamin-Ono models. We construct two parameter family of bell-shaped travelling waves for KdV (standing waves for NLS), which are constrained minimizers of the Hamiltonian. We show in particular that for each $\lambda > 0$, there is a travelling wave solution to fKdV and fNLS $\phi : \|\phi \|_{L^2[-T,T]}^2=\lambda $, which is non-degenerate. We also show that the waves are spectrally stable and orbitally stable, provided the Cauchy problem is locally well-posed in Hα/2[ − T, T] and a natural technical condition. This is done rigorously, without any a priori assumptions on the smoothness of the waves or the Lagrange multipliers.

In this paper, we investigate the global boundedness, asymptotic stability and pattern formation of predator–prey systems with density-dependent prey-taxis in a two-dimensional bounded domain with Neumann boundary conditions, where the coefficients of motility (diffusiq‘dfdon) and mobility (prey-taxis) of the predator are correlated through a prey density-dependent motility function. We establish the existence of classical solutions with uniform-in time bound and the global stability of the spatially homogeneous prey-only steady states and coexistence steady states under certain conditions on parameters by constructing Lyapunov functionals. With numerical simulations, we further demonstrate that spatially homogeneous time-periodic patterns, stationary spatially inhomogeneous patterns and chaotic spatio-temporal patterns are all possible for the parameters outside the stability regime. We also find from numerical simulations that the temporal dynamics between linearised system and nonlinear systems are quite different, and the prey density-dependent motility function can trigger the pattern formation.

In this work we consider three well-studied broadcast protocols: push, pull and push&pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they are simple, randomized and, crucially, do not utilize explicitly the global structure of the underlying graph. While sporadic results exist, there has been no systematic theoretical treatment quantifying the robustness of these models. Here we investigate this question with respect to two orthogonal aspects: (adversarial) modifications of the underlying graph and message transmission failures.

We explore in particular the following notion of local resilience: beginning with a graph, we investigate up to which fraction of the edges an adversary may delete at each vertex, so that the protocols need significantly more rounds to broadcast the information. Our main findings establish a separation among the three models. On one hand, pull is robust with respect to all parameters that we consider. On the other hand, push may slow down significantly, even if the adversary may modify the degrees of the vertices by an arbitrarily small positive fraction only. Finally, push&pull is robust when no message transmission failures are considered, otherwise it may be slowed down.

On the technical side, we develop two novel methods for the analysis of randomized rumour-spreading protocols. First, we exploit the notion of self-bounding functions to facilitate significantly the round-based analysis: we show that for any graph the variance of the growth of informed vertices is bounded by its expectation, so that concentration results follow immediately. Second, in order to control adversarial modifications of the graph we make use of a powerful tool from extremal graph theory, namely Szemerédi’s Regularity Lemma.

We analyse oscillatory instabilities for a coupled partial-ordinary differential equation (PDE-ODE) system modelling the communication between localised spatially segregated dynamically active signalling compartments that are coupled through a passive extracellular bulk diffusion field in a bounded 2D domain. Each signalling compartment is assumed to secrete a chemical into the extracellular medium (bulk region), and it can also sense the concentration of this chemical in the region around its boundary. This feedback from the bulk region, resulting from the entire collection of cells, in turn modifies the intracellular dynamics within each cell. In the limit where the signalling compartments are circular discs with a small common radius ɛ ≪ 1 and where the bulk diffusivity is asymptotically large, a matched asymptotic analysis is used to reduce the dimensionless PDE–ODE system into a nonlinear ODE system with global coupling. For Sel’kov reaction kinetics, this ODE system for the intracellular dynamics and the spatial average of the bulk diffusion field are then used to investigate oscillatory instabilities in the dynamics of the cells that are triggered due to the global coupling. In particular, numerical bifurcation software on the ODEs is used to study the overall effect of coupling defective cells (cells that behave differently from the remaining cells) to a group of identical cells. Moreover, when the number of cells is large, the Kuramoto order parameter is computed to predict the degree of phase synchronisation of the intracellular dynamics. Quorum sensing behaviour, characterised by the onset of collective behaviour in the intracellular dynamics as the number of cells increases above a threshold, is also studied. Our analysis shows that the cell population density plays a dual role of triggering and then quenching synchronous oscillations in the intracellular dynamics.

We study the existence of entropy solutions by assuming the right-hand side function f to be an integrable function for some elliptic nonlocal p-Laplacian type problems. Moreover, the existence of weak solutions for the corresponding parabolic cases is also established. The main aim of this paper is to provide some positive answers for the two questions proposed by Chipot and de Oliveira (Math. Ann., 2019, 375, 283-306).

A well-known observation of Lovász is that if a hypergraph is not 2-colourable, then at least one pair of its edges intersect at a single vertex. In this short paper we consider the quantitative version of Lovász’s criterion. That is, we ask how many pairs of edges intersecting at a single vertex should belong to a non-2-colourable n-uniform hypergraph. Our main result is an exact answer to this question, which further characterizes all the extremal hypergraphs. The proof combines Bollobás’s two families theorem with Pluhar’s randomized colouring algorithm.

The Virasoro algebra $\mathcal {L}$ is an infinite-dimensional Lie algebra with basis {Lm, C| m ∈ ℤ} and relations [Lm, Ln] = (n − m)Lm+n + δm+n,0((m3 − m)/12)C, [Lm, C] = 0 for m, n ∈ ℤ. Let $\mathfrak a$ be the subalgebra of $\mathcal {L}$ spanned by Li for i ≥ −1. For any triple (μ, λ, α) of complex numbers with μ ≠ 0, λ ≠ 0 and any non-trivial $\mathfrak a$-module V satisfying the condition: for any v ∈ V there exists a non-negative integer m such that Li v = 0 for all i ≥ m, non-weight $\mathcal {L}$-modules on the linear tensor product of V and ℂ[∂], denoted by $\mathcal {M}(V,\mu ,\Omega (\lambda ,\alpha ))\ (\Omega (\lambda ,\alpha )=\mathbb {C}[\partial ]$ as vector spaces), are constructed in this paper. We prove that $\mathcal {M}(V,\mu ,\Omega (\lambda ,\alpha ))$ is simple if and only if μ ≠ 1, λ ≠ 0, α ≠ 0. We also give necessary and sufficient conditions for two such simple $\mathcal {L}$-modules being isomorphic. Finally, these simple $\mathcal {L}$-modules $\mathcal {M}(V,\mu ,\Omega (\lambda ,\alpha ))$ are proved to be new for V not being the highest weight $\mathfrak a$-module whose highest weight is non-zero.

We give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.