This paper studies the spatio-temporal dynamics of a diffusive plant-sulphide model with toxicity delay. More specifically, the effects of discrete delay and distributed delay on the dynamics are explored, respectively. The deep analysis of eigenvalues indicates that both diffusion and delay can induce Hopf bifurcations. The normal form theory is used to set up an exact formula that determines the properties of Hopf bifurcation in a diffusive plant-sulphide model. A sufficiently small discrete delay does not affect the stability and a sufficiently large discrete delay destabilizes the system. Nonetheless, a sufficiently small or large distributed delay does not affect the stability. Both delays cause instability by inducing Hopf bifurcation rather than Turing bifurcation.

We study the Cauchy problem on the real line for the nonlocal Fisher-KPP equation in one spatial dimension,

\begin{equation*} u_t = D u_{xx} + u(1-\phi *u), \end{equation*}

$\phi *u$

$\phi (y) \equiv H\left (\frac{1}{4}-y^2\right )$

$u=1$

$D$

$\Delta _1 \approx 0.00297$

$D \ll 1$

$O(1)$

$u=O(1)$

$u$

$D \to 0^+$

$D \geq \Delta _1$

$2 \sqrt{D}$

$0 \lt D \lt \Delta _1$

$u=0$

$D$

A wake model is pursued for potential flow past a submerged, finite-length plate that is perpendicular to a uniform, horizontal stream bounded above by a free surface. The effects of gravity are included along the free surface. The approach is to adopt an open-wake model such that the wake boundaries become parallel to the undisturbed stream at some (unknown) point downstream. Boundary integral equations are formed and then discretised along the wake boundaries and free surface in order to obtain a solution numerically. In terms of the dependency of the solution on various parameters, the problem will be formulated in two ways. First, for a given Froude number and ratio of the length of the vertical plate to the draft (the depth of the bottom of the vertical plate relative to the undisturbed free surface), the effect of the wake underpressure coefficient on the size of the wake will be considered. Then, the problem will be discussed where we instead (more naturally) fix the Froude number, draft and length of the vertical, submerged plate. The dependencies of the solution on these parameters will be analysed regarding the effects on several factors, including the size of the wake, the relative lengths of the upper and lower wake boundaries, and the resulting wake underpressure coefficient.

Let $(A,\mathfrak{m})$ be a regular local ring of dimension $d \geq 1$, I an $\mathfrak{m}$-primary ideal. Let N be a nonzero finitely generated A-module. Consider the functions

\begin{equation*}t^I(N, n) = \sum_{i = 0}^{d}\ell(\text{Tor}^A_i(N, A/I^n)) \ \text{and}\ e^I(N, n) = \sum_{i = 0}^{d}\ell(\text{Ext}_A^i(N, A/I^n))\end{equation*}

of polynomial type and let their degrees be $t^I(N) $ and $e^I(N)$. We prove that $t^I(N) = e^I(N) = \max\{\dim N, d -1 \}$. A crucial ingredient in the proof is that $D^b(A)_f$, the bounded derived category of A with finite length cohomology, has no proper thick subcategories.

We examine a cyclic order on the directed edges of a tree whose vertices have cyclically ordered links. We use it to show that a graph of groups with left-cyclically ordered vertex groups and convex left-ordered edge groups is left-cyclically orderable.

The walk matrix associated to an $n\times n$ integer matrix $\mathbf{X}$ and an integer vector $b$ is defined by ${\mathbf{W}} \,:\!=\, (b,{\mathbf{X}} b,\ldots, {\mathbf{X}}^{n-1}b)$. We study limiting laws for the cokernel of $\mathbf{W}$ in the scenario where $\mathbf{X}$ is a random matrix with independent entries and $b$ is deterministic. Our first main result provides a formula for the distribution of the $p^m$-torsion part of the cokernel, as a group, when $\mathbf{X}$ has independent entries from a specific distribution. The second main result relaxes the distributional assumption and concerns the ${\mathbb{Z}}[x]$-module structure.

The motivation for this work arises from an open problem in spectral graph theory, which asks to show that random graphs are often determined up to isomorphism by their (generalised) spectrum. Sufficient conditions for generalised spectral determinacy can, namely, be stated in terms of the cokernel of a walk matrix. Extensions of our results could potentially be used to determine how often those conditions are satisfied. Some remaining challenges for such extensions are outlined in the paper.

In this paper, we deal with a weighted eigenvalue problem for the anisotropic $(p,q)$-Laplacian with Dirichlet boundary conditions. We study the main properties of the first eigenvalue and a reverse Hölder type inequality for the corresponding eigenfunctions.

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let ${\mathcal G}(n,W)$ be the random graph obtained by independently including each edge $jk\in \binom{[n]}{2}$ with probability $W_{jk}=W_{kj}$. Given a degree sequence $\textbf{d}=(d_1,\ldots, d_n)$, let ${\mathcal G}(n,\textbf{d})$ denote a uniformly random graph with degree sequence $\textbf{d}$. We couple ${\mathcal G}(n,W)$ and ${\mathcal G}(n,\textbf{d})$ together so that asymptotically almost surely ${\mathcal G}(n,W)$ is a subgraph of ${\mathcal G}(n,\textbf{d})$, where $W$ is some function of $\textbf{d}$. Let $\Delta (\textbf{d})$ denote the maximum degree in $\textbf{d}$. Our coupling result is optimal when $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$, that is, $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for every $i,j\in [n]$. We also have coupling results for $\textbf{d}$ that are not constrained by the condition $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$. For such $\textbf{d}$ our coupling result is still close to optimal, in the sense that $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for most pairs $ij\in \binom{[n]}{2}$.

We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core model, a well-studied discrete spin system. Given an instance of such a point process, our reduction generates a random graph drawn from a natural geometric model. We show that the partition function of a hard-core model on graphs generated by the geometric model concentrates around the partition function of the Gibbs point process. Our reduction allows us to use a broad range of algorithms developed for the hard-core model to sample from the Gibbs point process and approximate its partition function. This is, to the extent of our knowledge, the first approach that deals with pair potentials of unbounded range.

Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-chromatic vertex-critical graph $G$ such that $\chi (G-R)=k$ for every set $R \subseteq E(G)$ with $|R|\le r$. This partially solves a problem posed by Erdős in 1985, who asked whether the above statement holds for $k \ge 4$.

We use Stein’s method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and multi-variate Poisson approximations to the counts of cycles and normal approximations to the counts of unicyclic subgraphs; we also give a partial result for the counts of trees. We further find a class of multicyclic graphs whose subgraph counts are a.s. bounded as $n\to \infty$.

Let $\eta $ be [-11pc] [-7pc]a closed real 1-form on a closed Riemannian n-manifold $(M,g)$. Let $d_z$, $\delta _z$ and $\Delta _z$ be the induced Witten’s type perturbations of the de Rham derivative and coderivative and the Laplacian, parametrized by $z=\mu +i\nu \in \mathbb C$ ($\mu ,\nu \in \mathbb {R}$, $i=\sqrt {-1}$). Let $\zeta (s,z)$ be the zeta function of $s\in \mathbb {C}$, defined as the meromorphic extension of the function $\zeta (s,z)=\operatorname {Str}({\eta \wedge }\,\delta _z\Delta _z^{-s})$ for $\Re s\gg 0$. We prove that $\zeta (s,z)$ is smooth at $s=1$ and establish a formula for $\zeta (1,z)$ in terms of the associated heat semigroup. For a class of Morse forms, $\zeta (1,z)$ converges to some $\mathbf {z}\in \mathbb {R}$ as $\mu \to +\infty $, uniformly on $\nu $. We describe $\mathbf {z}$ in terms of the instantons of an auxiliary Smale gradient-like vector field X and the Mathai–Quillen current on $TM$ defined by g. Any real 1-cohomology class has a representative $\eta $ satisfying the hypothesis. If n is even, we can prescribe any real value for $\mathbf {z}$ by perturbing g, $\eta $ and X and achieve the same limit as $\mu \to -\infty $. This is used to define and describe certain tempered distributions induced by g and $\eta $. These distributions appear in another publication as contributions from the preserved leaves in a trace formula for simple foliated flows, giving a solution to a problem stated by C. Deninger.

We show that if one of various cycle types occurs in the permutation action of a finite group on the cosets of a given subgroup, then every almost conjugate subgroup is conjugate. As a number theoretic application, corresponding decomposition types of primes effect that a number field is determined by the Dedekind zeta function. As a geometric application, coverings of Riemannian manifolds with certain geodesic lifting behaviours must be isometric.

For given positive integers $r\ge 3$, $n$ and $e\le \binom{n}{2}$, the famous Erdős–Rademacher problem asks for the minimum number of $r$-cliques in a graph with $n$ vertices and $e$ edges. A conjecture of Lovász and Simonovits from the 1970s states that, for every $r\ge 3$, if $n$ is sufficiently large then, for every $e\le \binom{n}{2}$, at least one extremal graph can be obtained from a complete partite graph by adding a triangle-free graph into one part.

In this note, we explicitly write the minimum number of $r$-cliques predicted by the above conjecture. Also, we describe what we believe to be the set of extremal graphs for any $r\ge 4$ and all large $n$, amending the previous conjecture of Pikhurko and Razborov.

Let $X, Y$ be two locally compact Hausdorff spaces and $T:C_0(X)\rightarrow C_0(Y)$ be a standard surjective ɛ-norm-additive map, i.e.

\begin{equation*}\big|\|T(f)+T(g)\|-\|f+g\|\big|\leq \varepsilon,\;{\rm for\;all}\; f, g\in C_0(X).\end{equation*}

Then there exist a homeomorphism $\varphi:Y\rightarrow X$ and a continuous function $\lambda:Y\rightarrow\lbrace\pm1\rbrace$ such that

\begin{equation*}|T(f)(y)-\lambda(y)f(\varphi(y))|\leq\frac{3}{2}\varepsilon,\;{\rm for\;all}\;y\in Y,\;f\in C_0(X).\end{equation*}

The estimate ‘$\frac{3}{2}\varepsilon$’ is optimal. And this result can be regarded as a new nonlinear extension of the Banach–Stone theorem.

This article offers an advanced and novel investigation into the intricate propagation dynamics of the Belousov–Zhabotinsky system with non-local delayed interaction, which exhibits dynamical transition structure from bistable to monostable. We first solved the enduring open problem concerning the existence, uniqueness and the speed sign of the bistable travelling waves. In the monostable case, we developed and derived new results for the minimal wave speed selection, which, as an application, further improved the existing investigations on pushed and pulled wavefronts. Our results can provide new estimate to the minimal speed as well as to the determinacy of the transition parameters. Moreover, these results can be directly applied to standard localised models and delayed reaction diffusion models by choosing appropriate kernel functions.

We consider the community detection problem in sparse random hypergraphs under the non-uniform hypergraph stochastic block model (HSBM), a general model of random networks with community structure and higher-order interactions. When the random hypergraph has bounded expected degrees, we provide a spectral algorithm that outputs a partition with at least a $\gamma$ fraction of the vertices classified correctly, where $\gamma \in (0.5,1)$ depends on the signal-to-noise ratio (SNR) of the model. When the SNR grows slowly as the number of vertices goes to infinity, our algorithm achieves weak consistency, which improves the previous results in Ghoshdastidar and Dukkipati ((2017) Ann. Stat. 45(1) 289–315.) for non-uniform HSBMs.

Our spectral algorithm consists of three major steps: (1) Hyperedge selection: select hyperedges of certain sizes to provide the maximal signal-to-noise ratio for the induced sub-hypergraph; (2) Spectral partition: construct a regularised adjacency matrix and obtain an approximate partition based on singular vectors; (3) Correction and merging: incorporate the hyperedge information from adjacency tensors to upgrade the error rate guarantee. The theoretical analysis of our algorithm relies on the concentration and regularisation of the adjacency matrix for sparse non-uniform random hypergraphs, which can be of independent interest.

In this work, we study early warning signs for stochastic partial differential equations (SPDEs), where the linearisation around a steady state is characterised by continuous spectrum. The studied warning sign takes the form of qualitative changes in the variance as a deterministic bifurcation threshold is approached via parameter variation. Specifically, we focus on the scaling law of the variance near the transition. Since we are dealing here, in contrast to previous studies, with the case of continuous spectrum and quantitative scaling laws, it is natural to start with linearisations of the drift operator that are multiplication operators defined by analytic functions. For a one-dimensional spatial domain, we obtain precise rates of divergence. In the case of the two- and three-dimensional domains, an upper bound to the rate of the early warning sign is proven. These results are cross-validated by numerical simulations. Our theory can be generically useful for several applications, where stochastic and spatial aspects are important in combination with continuous spectrum bifurcations.