To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We show that for every $\eta \gt 0$ every sufficiently large $n$-vertex oriented graph $D$ of minimum semidegree exceeding $(1+\eta )\frac k2$ contains every balanced antidirected tree with $k$ edges and bounded maximum degree, if $k\ge \eta n$. In particular, this asymptotically confirms a conjecture of the first author for long antidirected paths and dense digraphs.
Further, we show that in the same setting, $D$ contains every $k$-edge antidirected subdivision of a sufficiently small complete graph, if the paths of the subdivision that have length $1$ or $2$ span a forest. As a special case, we can find all antidirected cycles of length at most $k$.
Finally, we address a conjecture of Addario-Berry, Havet, Linhares Sales, Reed, and Thomassé for antidirected trees in digraphs. We show that this conjecture is asymptotically true in $n$-vertex oriented graphs for all balanced antidirected trees of bounded maximum degree and of size linear in $n$.
A result of Gyárfás [12] exactly determines the size of a largest monochromatic component in an arbitrary $r$-colouring of the complete $k$-uniform hypergraph $K_n^k$ when $k\geq 2$ and $k\in \{r-1,r\}$. We prove a result which says that if one replaces $K_n^k$ in Gyárfás’ theorem by any ‘expansive’ $k$-uniform hypergraph on $n$ vertices (that is, a $k$-uniform hypergraph $G$ on $n$ vertices in which $e(V_1, \ldots, V_k)\gt 0$ for all disjoint sets $V_1, \ldots, V_k\subseteq V(G)$ with $|V_i|\gt \alpha$ for all $i\in [k]$), then one gets a largest monochromatic component of essentially the same size (within a small error term depending on $r$ and $\alpha$). As corollaries we recover a number of known results about large monochromatic components in random hypergraphs and random Steiner triple systems, often with drastically improved bounds on the error terms.
Gyárfás’ result is equivalent to the dual problem of determining the smallest possible maximum degree of an arbitrary $r$-partite $r$-uniform hypergraph $H$ with $n$ edges in which every set of $k$ edges has a common intersection. In this language, our result says that if one replaces the condition that every set of $k$ edges has a common intersection with the condition that for every collection of $k$ disjoint sets $E_1, \ldots, E_k\subseteq E(H)$ with $|E_i|\gt \alpha$, there exists $(e_1, \ldots, e_k)\in E_1\times \cdots \times E_k$ such that $e_1\cap \cdots \cap e_k\neq \emptyset$, then the smallest possible maximum degree of $H$ is essentially the same (within a small error term depending on $r$ and $\alpha$). We prove our results in this dual setting.
For a graph $H$ and a hypercube $Q_n$, $\textrm{ex}(Q_n, H)$ is the largest number of edges in an $H$-free subgraph of $Q_n$. If $\lim _{n \rightarrow \infty } \textrm{ex}(Q_n, H)/|E(Q_n)| \gt 0$, $H$ is said to have a positive Turán density in a hypercube or simply a positive Turán density; otherwise, it has zero Turán density. Determining $\textrm{ex}(Q_n, H)$ and even identifying whether $H$ has a positive or zero Turán density remains a widely open question for general $H$. By relating extremal numbers in a hypercube and certain corresponding hypergraphs, Conlon found a large class of graphs, ones having so-called partite representation, that have zero Turán density. He asked whether this gives a characterisation, that is, whether a graph has zero Turán density if and only if it has partite representation. Here, we show that, as suspected by Conlon, this is not the case. We give an example of a class of graphs which have no partite representation, but on the other hand, have zero Turán density. In addition, we show that any graph whose every block has partite representation has zero Turán density in a hypercube.
Tao and Vu showed that every centrally symmetric convex progression $C\subset \mathbb{Z}^d$ is contained in a generalized arithmetic progression of size $d^{O(d^2)} \# C$. Berg and Henk improved the size bound to $d^{O(d\log d)} \# C$. We obtain the bound $d^{O(d)} \# C$, which is sharp up to the implied constant and is of the same form as the bound in the continuous setting given by John’s theorem.
This paper is concerned with stochastic Schrödinger delay lattice systems with both locally Lipschitz drift and diffusion terms. Based on the uniform estimates and the equicontinuity of the segment of the solution in probability, we show the tightness of a family of probability distributions of the solution and its segment process, and hence the existence of invariant measures on $l^2\times L^2((-\rho,\,0);l^2)$ with $\rho >0$. We also establish a large deviation principle for the solutions with small noise by the weak convergence method.
In this paper, we analyse Turing instability and bifurcations in a host–parasitoid model with nonlocal effect. For a ordinary differential equation model, we provide some preliminary analysis on Hopf bifurcation. For a reaction–diffusion model with local intraspecific prey competition, we first explore the Turing instability of spatially homogeneous steady states. Next, we show that the model can undergo Hopf bifurcation and Turing–Hopf bifurcation, and find that a pair of spatially nonhomogeneous periodic solutions is stable for a (8,0)-mode Turing–Hopf bifurcation and unstable for a (3,0)-mode Turing–Hopf bifurcation. For a reaction–diffusion model with nonlocal intraspecific prey competition, we study the existence of the Hopf bifurcation, double-Hopf bifurcation, Turing bifurcation, and Turing–Hopf bifurcation successively, and find that a spatially nonhomogeneous quasi-periodic solution is unstable for a (0,1)-mode double-Hopf bifurcation. Our results indicate that the model exhibits complex pattern formations, including transient states, monostability, bistability, and tristability. Finally, numerical simulations are provided to illustrate complex dynamics and verify our theoretical results.
We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give applications of these results to new bounds on correlations between Salié sums and to a new equidistribution estimate for the set of modular roots of primes.
where $\Omega \subset \mathbb {R}^{3}$ is a bounded domain, either convex or with $\mathcal {C}^{1,1}$ boundary, $\nu$ is the exterior normal, $\lambda <0$ is a real parameter, $2^{\ast }_{\alpha }=3+\alpha$ with $0<\alpha <3$ is the upper critical exponent due to the Hardy–Littlewood–Sobolev inequality. By introducing some suitable Coulomb spaces involving curl operator $W^{\alpha,2^{\ast }_{\alpha }}_{0}(\mathrm {curl};\Omega )$, we are able to obtain the ground state solutions of the curl–curl equation via the method of constraining Nehari–Pankov manifold. Correspondingly, some sharp constants of the Sobolev-like inequalities with curl operator are obtained by a nonlocal version of the concentration–compactness principle.
A set of complex numbers $S$ is called invariant if it is closed under addition and multiplication, namely, for any $x, y \in S$ we have $x+y \in S$ and $xy \in S$. For each $s \in {\mathbb {C}}$ the smallest invariant set ${\mathbb {N}}[s]$ containing $s$ consists of all possible sums $\sum _{i \in I} a_i s^i$, where $I$ runs over all finite nonempty subsets of the set of positive integers ${\mathbb {N}}$ and $a_i \in {\mathbb {N}}$ for each $i \in I$. In this paper, we prove that for $s \in {\mathbb {C}}$ the set ${\mathbb {N}}[s]$ is everywhere dense in ${\mathbb {C}}$ if and only if $s \notin {\mathbb {R}}$ and $s$ is not a quadratic algebraic integer. More precisely, we show that if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is a transcendental number, then there is a positive integer $n$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for either $t=s$ or $t=s+s^2$. Similarly, if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is an algebraic number of degree $d \ne 2, 4$, then there are positive integers $n, m$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for $t=ms+s^2$. For quadratic and some special quartic algebraic numbers $s$ it is shown that a similar sumset of three sets cannot be dense. In each of these two cases the density of ${\mathbb {N}}[s]$ in ${\mathbb {C}}$ is established by a different method: for those special quartic numbers, it is possible to take a sumset of four sets.
We formulate haptotaxis models of cancer invasion wherein the infiltrating cancer cells can occupy a spectrum of states in phenotype space, ranging from ‘fully mesenchymal’ to ‘fully epithelial’. The more mesenchymal cells are those that display stronger haptotaxis responses and have greater capacity to modify the extracellular matrix (ECM) through enhanced secretion of matrix-degrading enzymes (MDEs). However, as a trade-off, they have lower proliferative capacity than the more epithelial cells. The framework is multiscale in that we start with an individual-based model that tracks the dynamics of single cells, which is based on a branching random walk over a lattice representing both physical and phenotype space. We formally derive the corresponding continuum model, which takes the form of a coupled system comprising a partial integro-differential equation for the local cell population density function, a partial differential equation for the MDE concentration and an infinite-dimensional ordinary differential equation for the ECM density. Despite the intricacy of the model, we show, through formal asymptotic techniques, that for certain parameter regimes it is possible to carry out a detailed travelling wave analysis and obtain invading fronts with spatial structuring of phenotypes. Precisely, the most mesenchymal cells dominate the leading edge of the invasion wave and the most epithelial (and most proliferative) dominate the rear, representing a bulk tumour population. As such, the model recapitulates similar observations into a front to back structuring of invasion waves into leader-type and follower-type cells, witnessed in an increasing number of experimental studies over recent years.
The paper is concerned with positive solutions to problems of the type
\[ -\Delta_{\mathbb{B}^{N}} u - \lambda u = a(x) |u|^{p-1}\;u + f \text{ in }\mathbb{B}^{N}, \quad u \in H^{1}{(\mathbb{B}^{N})}, \]
where $\mathbb {B}^N$ denotes the hyperbolic space, $1< p<2^*-1:=\frac {N+2}{N-2}$, $\;\lambda < \frac {(N-1)^2}{4}$, and $f \in H^{-1}(\mathbb {B}^{N})$ ($f \not \equiv 0$) is a non-negative functional. The potential $a\in L^\infty (\mathbb {B}^N)$ is assumed to be strictly positive, such that $\lim _{d(x, 0) \rightarrow \infty } a(x) \rightarrow 1,$ where $d(x,\, 0)$ denotes the geodesic distance. First, the existence of three positive solutions is proved under the assumption that $a(x) \leq 1$. Then the case $a(x) \geq 1$ is considered, and the existence of two positive solutions is proved. In both cases, it is assumed that $\mu ( \{ x : a(x) \neq 1\}) > 0.$ Subsequently, we establish the existence of two positive solutions for $a(x) \equiv 1$ and prove asymptotic estimates for positive solutions using barrier-type arguments. The proofs for existence combine variational arguments, key energy estimates involving hyperbolic bubbles.
We generalize the known collision results for a solid in a 3D compressible Newtonian fluid to compressible non-Newtonian ones, and to Newtonian fluids with temperature-depending viscosities.
In this paper, we consider the following non-linear system involving the fractional Laplacian0.1
\begin{equation} \left\{\begin{array}{@{}ll} (-\Delta)^{s} u (x)= f(u,\,v), \\ (-\Delta)^{s} v (x)= g(u,\,v), \end{array} \right. \end{equation}
in two different types of domains, one is bounded, and the other is an infinite cylinder, where $0< s<1$. We employ the direct sliding method for fractional Laplacian, different from the conventional extension and moving planes methods, to derive the monotonicity of solutions for (0.1) in $x_n$ variable. Meanwhile, we develop a new iteration method for systems in the proofs. Hopefully, the iteration method can also be applied to solve other problems.