A new approach toward stabilization in a two-species chemotaxis model with logistic source

This paper aims at providing an alternative approach to study global dynamic properties for a two-species chemotaxis model, with the main novelty being that both populations mutually compete with the other on account of the Lotka–Volterra dynamics. More precisely, we consider the following Neumann initial–boundary value problem

in a bounded domain $\Omega ?{\mathbb{R}}^n,n\ge 1$, with smooth boundary, where $d_1,d_2,d_3,{\chi }_1,{\chi }_2,{\mu }_1,{\mu }_2,a_1,a_2$ are positive constants.When $a_1\in (0,1)$ and $a_2\in (0,1)$, it is shown that under some explicit largeness assumptions on the logistic growth coefficients ${\mu }_1$ and ${\mu }_2$, the corresponding Neumann initial–boundary value problem possesses a unique global bounded solution which moreover approaches a unique positive homogeneous steady state $(u^1,v^1,w^1)$ of above system in the large time limit. The respective decay rate of this convergence is shown to be exponential.When $a_1\ge 1$ and $a_2\in (0,1)$, if ${\mu }_2$ is suitable large, for all sufficiently regular nonnegative initial data $u_0$ and $v_0$ with $u_0?0$ and $v_0?0$, the globally bounded solution of above system will stabilize toward $(0,1,1)$ as $t\to \infty$ in algebraic.     

Trees with minimal Laplacian coefficients

Let $G$ be a simple undirected graph with the characteristic polynomial of its Laplacian matrix $L\left(G\right)$, $P(G,\mu )={\sum }_{k=0}^n{(?1)}^k{c}_k{\mu }^{n?k}$. It is well known that for trees the Laplacian coefficient $c_{n?2}$ is equal to the Wiener index of $G$, while $c_{n?3}$ is equal to the modified hyper-Wiener index of the graph. In this paper, we characterize $n$-vertex trees with given matching number $m$ which simultaneously minimize all Laplacian coefficients. The extremal tree $A(n,m)$ is a spur, obtained from the star graph $S_{n?m+1}$ with $n?m+1$ vertices by attaching a pendant edge to each of certain $m?1$ non-central vertices of $S_{n?m+1}$. In particular, $A(n,m)$ minimizes the Wiener index, the modified hyper-Wiener index and the recently introduced Incidence energy of trees, defined as $IE\left(G\right)={\sum }_{k=0}^n\sqrt{{\mu }_k}$, where ${\mu }_k$ are the eigenvalues of signless Laplacian matrix $Q\left(G\right)=D\left(G\right)+A\left(G\right)$. We introduced a general $\rho$ transformation which decreases all Laplacian coefficients simultaneously. In conclusion, we illustrate on examples of Wiener index and Incidence energy that the opposite problem of simultaneously maximizing all Laplacian coefficients has no solution.     

Suslin’s algorithms for reduction of unimodular rows

A well-known lemma of Suslin says that for a commutative ring $A$ if $(v_1\left(X\right),\dots ,v_n\left(X\right))\in {\left(A\left[X\right]\right)}^n$ is unimodular where $v_1$ is monic and $n\ge 3$, then there exist ${\gamma }_1,\dots ,{\gamma }_{\ell }\in E_{n-1}\left(A\left[X\right]\right)$ such that the ideal generated by $\mathrm{Res}(v_1,e_1.{\gamma }_1{}^t(v_2,\dots ,v_n)),\dots ,\mathrm{Res}(v_1,e_1.{\gamma }_{\ell }{}^t(v_2,\dots ,v_n))$ equals $A$. This lemma played a central role in the resolution of Serre’s Conjecture. In the case where $A$ contains a set $E$ of cardinality greater than $deg{v}_1+1$ such that $y-y^{\prime }$ is invertible for each $y\ne y^{\prime }$ in $E$, we prove that the ${\gamma }_i$ can simply correspond to the elementary operations $L_1\to L_1+y_i{\sum }_{j=2}^{n-1}{u}_{j+1}{L}_j$, $1\le i\le \ell =deg{v}_1+1$, where $u_1{v}_1+\cdots +u_n{v}_n=1$. These efficient elementary operations enable us to give new and simple algorithms for reducing unimodular rows with entries in $K[X_1,\dots ,X_k]$ to ${}^t(1,0,\dots ,0)$ using elementary operations in the case where $K$ is an infinite field. Another feature of this paper is that it shows that the concrete local–global principles can produce competitive complexity bounds.     

Convergence for a family of discrete advection–reaction operators

We define a family of discrete Advection–reaction operators, denoted by $A_{a\lambda }$, which associate to a given scalar sequence $s=\left\{s_n\right\}$ the sequence given by $A_{a\lambda }\left(s\right)\equiv \left\{b_n\right\}$, where $b_n=a_{n?2}{s}_{n?1}+{\lambda }_n{s}_n$ for $n=1,2,\dots$. For $A_{a\lambda }$ we explicitly find their iterates and study their convergence properties. Finally, we show the relationship between the family of discrete operators with the continuous one dimensional advection–reaction equation.     

On average and highest number of flips in pancake sorting

We are given a stack of pancakes of different sizes and the only allowed operation is to take several pancakes from the top and flip them. The unburnt version requires the pancakes to be sorted by their sizes at the end, while in the burnt version they additionally need to be oriented burnt-side down. We are interested in the largest value of the number of flips needed to sort a stack of $n$ pancakes, both in the unburnt version ($f\left(n\right)$) and in the burnt version ($g\left(n\right)$).We present exact values of $f\left(n\right)$ up to $n=19$ and of $g\left(n\right)$ up to $n=17$ and disprove a conjecture of Cohen and Blum by showing that the burnt stack $?I_{15}$ is not the hardest to sort for $n=15$.We also show that sorting a random stack of $n$ unburnt pancakes can be done with at most $17n/12+O\left(1\right)$ flips on average. The average number of flips of the optimal algorithm for sorting stacks of $n$ burnt pancakes is shown to be between $n+\Omega (n/logn)$ and $7n/4+O\left(1\right)$ and we conjecture that it is $n+\Theta (n/logn)$.Finally we show that sorting the stack $?I_n$ needs at least $?(3n+3)/2?$ flips, which slightly increases the lower bound on $g\left(n\right)$. This bound together with the upper bound for sorting $?I_n$ found by Heydari and Sudborough in 1997 [10] gives the exact number of flips to sort it for $n\equiv 3(mod4)$ and $n\ge 15$.     

Longest paths and cycles in faulty star graphs

In this paper, we investigate the star graph $S_n$ with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of $S_n$, $n⩾4$, there is a fault-free path of length at least $n!-2f_v-1$, and there is a path of length at least $n!-2f_v-2$ joining a pair of vertices with the same color, when the number of faulty elements is $n-3$ or less. Here, $f_v$ is the number of faulty vertices. $S_n$, $n⩾4$, with at most $n-2$ faulty elements has a fault-free cycle of length at least $n!-2f_v$ unless the number of faulty elements are $n-2$ and all the faulty elements are edges incident to a common vertex. It is also shown that $S_n$, $n⩾4$, is strongly hamiltonian-laceable if the number of faulty elements is $n-3$ or less and the number of faulty vertices is one or less.     

Energy decay rate for a von Karman system with a boundary nonlinear delay term

In this paper, we show the energy decay rate for a von Karman system with a boundary nonlinear delay term. This work is devoted to investigate the influence of kernel function $g$ and the effect of the boundary nonlinear term ${\mu }_1{\left|u_t\left(t\right)\right|}^{m?1}{u}_t\left(t\right)$, a boundary nonlinear time delay term ${\mu }_2{\left|u_t(t?\tau )\right|}^{m?1}{u}_t(t?\tau )$ and prove energy decay rates of solutions when $g$ do not necessarily decay exponentially and the boundary condition has a time delay.     

Finite time blow-up for a class of parabolic or pseudo-parabolic equations

In this paper, we study the initial boundary value problem for a class of parabolic or pseudo-parabolic equations:

$u_t?a\Delta u_t?\Delta u+bu=k\left(t\right)|u{|}^{p?2}u,(x,t)\in \Omega \times (0,T),$

where $a\ge 0$, $b>?{?}_1$ with ${?}_1$ being the principal eigenvalue for $?\Delta$ on $H_0^1\left(\Omega \right)$ and $k\left(t\right)>0$. By using the potential well method, Levine’s concavity method and some differential inequality techniques, we obtain the finite time blow-up results provided that the initial energy satisfies three conditions: (i) $J(u_0;0)<0$; (ii) $J(u_0;0)\le d\left(\infty \right)$, where $d\left(\infty \right)$ is a nonnegative constant; (iii) $0<J(u_0;0)\le C\rho \left(0\right)$, where $\rho \left(0\right)$ involves the $L^2$-norm or $H_0^1$-norm of the initial data. We also establish the lower and upper bounds for the blow-up time. In particular, we obtain the existence of certain solutions blowing up in finite time with initial data at the Nehari manifold or at arbitrary energy level.     

Boundedness in the higher-dimensional quasilinear chemotaxis-growth system with indirect attractant production

This paper deals with the following quasilinear chemotaxis-growth system

in a smoothly bounded domain $\Omega ?{\mathbb{R}}^n(n\ge 3)$ under zero-flux boundary conditions. The parameters $\mu ,\delta$ and $\tau$ are positive and the diffusion function $D\left(u\right)$ is supposed to generalize the prototype $D\left(u\right)\ge D_0{u}^{\theta }$ with $D_0>0$ and $\theta \in \mathbb{R}$. Under the assumption $\theta >1?\frac{4}{n}$, it is proved that whenever $\mu >0$, $\tau >0$ and $\delta >0$, for any given nonnegative and suitably smooth initial data ($u_0$, $v_0$, $w_0$) satisfying $u_0?0$, the corresponding initial–boundary problem possesses a unique global solution which is uniformly-in-time bounded. The novelty of the paper is that we use the boundedness of the $\left|\right|v(?,t)|{|}_{W^{1,s}\left(\Omega \right)}$ with $s\in [1,\frac{2n}{n?2})$ to estimate the boundedness of $\left|\right|?v(?,t)|{|}_{L^{2q}\left(\Omega \right)}(q>1)$. Moreover, the result in this paper can be regarded as an extension of a previous consequence on global existence of solutions by Hu et al. (2016) under the condition that $D\left(u\right)\equiv 1$ and $n=3$.