Oscillatory and transient dynamics of a slow–fast predator–prey system with fear and its carry-over effect

In almost every ecological system, growth of various interacting species evolve in different time scales and the implementation of this time scale difference in the corresponding mathematical model exhibits some rich and complex oscillatory dynamics. In this article, we consider a predator–prey model with Beddington–DeAngelis functional response in which the prey reproduction is affected by the predation induced fear and its carry-over effect. Considering the growth of prey species occurs on a faster time scale than that of predator, the proposed system reduces to a ‘slow–fast predator–prey’ system. Using the geometric singular perturbation theory and asymptotic expansion technique, we investigate the system both analytically and numerically, and observe a wide range of rich and complex dynamics such as canard cycles (with or without head) near the singular Hopf-bifurcation threshold and relaxation oscillation cycles. The system experiences a canard explosion through which a rapid transition from small amplitude limit cycle to large amplitude limit cycle occurs in a tiny parametric interval. These types of complex oscillatory dynamics are absent in non slow–fast systems. Furthermore, it is shown that the interplay between fear and its carry-over effect, and the variation of time scale parameter may lead to a regime shift of the oscillatory dynamics. We also study the impact of fear and its carry-over effect on the properties of long transient dynamics. Thus our study provides some valuable biological insights of a slow–fast predator–prey system which will aid in understanding the interplay between fear and its carry-over effect.     

A note on ball-covering property of Banach spaces

By a ball-covering B of a Banach space X, we mean that B is a collection of open (or closed) balls off the origin whose union contains the unit sphere SX of X; and X is said to have the ball-covering property (BCP) provided it admits a ball-covering by countably many balls. In this note we give a natural example showing that the ball-covering property of a Banach space is not inherited by its subspaces; and we present a sharp quantitative version of the recent Fonf and Zanco renorming result saying that if the dual X^∗ of X is w^∗ separable, then for every ε>0 there exist a (1+ε)-equivalent norm on X, and an R>0 such that in this new norm SX admits a ball-covering by countably many balls of radius R. Namely, we show that R=R(ε) can be taken arbitrarily close to (1+ε)/ε, and that for X=?₁[0,1] the corresponding R cannot be equal to 1/ε. This gives the sharp order of magnitude for R(ε) as ε→0.     

An algorithm for then×n optimum assignment problem

In this paper we present an algorithm for finding an optimum assignment for ann×n matrixM inn iterations. The method uses systematic permutations on the rows ofM and is based on the properties of optimum assignments. The implementation presented in the paper requires at mostO(n ³) in time andn ²+6n memory locations for solving a densen×n problem.This work was supported by the National Science Foundation Grant NSF ENG 74-19788.     

Graphs with maximum size and lower bounded girth

For integers n≥4 and ν≥n+1, let ex(ν;{C₃,…,C_n}) denote the maximum number of edges in a graph of order ν and girth at least n+1. The {C₃,…,C_n}-free graphs with order ν and size ex(ν;{C₃,…,C_n}) are called extremal graphs and denoted by EX(ν;{C₃,…,C_n}). We prove that given an integer k≥0, for each n≥2log₂(k+2) there exist extremal graphs with ν vertices, ν+k edges and minimum degree 1 or 2. Considering this idea we construct four infinite families of extremal graphs. We also see that minimal (r;g)-cages are the exclusive elements in EX(ν₀(r,g);{C₃,…,C_g−1}).     

广义de Sitter空间中法向Lorentzian超曲面的nullcone Gauss映射的奇点

利用奇点理论研究了广义de Sitter空间中具有Lorentzian法空间的一类超曲面.介绍了这类超曲面的局部微分几何,定义了nullcone Gauss映射及nullcone高度函数族,进而研究了nullcone高度函数族的性质及nullcone高斯映射的几何意义,最后研究了这类超曲面的通有性质.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

Interpolating polynomial wavelets on [−1,1]

The present paper gives a contribution of wavelet aspects to classical algebraic polynomial approximation theory. As is so often the case in classical approximation, the authors follow the pattern provided by the trigonometric polynomial case. Algebraic polynomial interpolating scaling functions and wavelets are constructed by using the interpolation properties of de la Vallée Poussin kernels with respect to the four kinds of Chebyshev weights. For the decomposition and reconstruction of a given function the structure of the involved matrices is studied in order to reduce the computational effort by means of fast discrete cosine and sine transforms. Dedicated to Prof. Guiseppe Mastroianni on the occasion of his 65th birthday.AMS subject classification 65D05, 65T60     

Properly colored hamilton cycles in edge-colored complete graphs

It is shown that, for ϵ>0 and n>n₀(ϵ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1-1/\sqrt2-\epsilon)n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and n any such K contains a cycle of length k in which adjacent edges have distinct colors. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 179–186 (1997)     

On approximations of the de Rham complex and their cohomology

For a commutative algebra R, its de Rham cohomology is an important invariant of R. In the paper, an infinite chain of de Rham-like complexes is introduced where the first member of the chain is the de Rham complex. The complexes are called approximations of the de Rham complex. Their cohomologies are found for polynomial rings and algebras of power series over a field of characteristic zero.