Existence and global attractivity of positive periodic solutions for delay Lotka-Volterra competition patch systems with stocking

By means of Mawhin's continuation theorem of coincidence degree and Lyapunov functional, a set of easily verifiable criteria are established for the existence and global attractivity of positive periodic solutions for delay Lotka-Volterra competition patch system with stocking

     

On the quantifier complexity of Δ<Subscript> n+1</Subscript> (T)– induction

In this paper we continue the study of the theories I _n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that I _n+1 (T) is _n+2 –axiomatizable. In particular, I _n+1 (I _n+1 ) gives an axiomatization of Th _n+2 (I _n+1 ) and is not finitely axiomatizable. This fact relates the fragment I _n+1 (I _n+1 ) to induction rule for _n+1 –formulas. Our arguments, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for _n+2 and _n+1 formulas (see [2]).Research partially supported by grant PB96–1345 (Spanish Goverment)Mathematics Subject Classification (2000): 03F30, 03H15     

Four-dimensional lattice rules generated by skew-circulant matrices

We introduce the class of skew-circulant lattice rules. These are -dimensional lattice rules that may be generated by the rows of an skew-circulant matrix. (This is a minor variant of the familiar circulant matrix.) We present briefly some of the underlying theory of these matrices and rules. We are particularly interested in finding rules of specified trigonometric degree . We describe some of the results of computer-based searches for optimal four-dimensional skew-circulant rules. Besides determining optimal rules for we have constructed an infinite sequence of rules that has a limit rho index of . This index is an efficiency measure, which cannot exceed 1, and is inversely proportional to the abscissa count.

     

Some remarks on the symmetric rank-one update

We consider the symmetric rank-one, quasi-Newton formula. The hereditary properties of this formula do not require quasi-Newton directions of search. Therefore, this formula is easy to use in constrained optimization algorithms; no explicit projections of either the Hessian approximations or the parameter changes are required. Moreover, the entire Hessian approximation is available at each iteration for determining the direction of search, which need not be a quasi-Newton direction. Theoretical difficulties, however, exist. Even for a positive-definite, quadratic function with no constraints, it is possible that the symmetric rank-one update may not be defined at some iteration. In this paper, we first demonstrate that such failures of definition correspond to either losses of independence in the directions of search being generated or to near-singularity of the Hessian approximation being generated. We then describe a procedure that guarantees that these updates are well-defined for any nonsingular quadratic function. This procedure has been incorporated into an algorithm for minimizing a function subject to box constraints. Box constraints arise naturally in the minimization of a function with many minima or a function that is defined only in some subregion of the space.     

On the Convergence Behaviour of Variable Stepsize Multistep Methods for Singularly Perturbed Problems

In this note, we investigate the convergence behaviour of linear multistep discretizations for singularly perturbed systems, emphasising the features of variable stepsizes. We derive a convergence result for A()-stable linear multistep methods and specify a refined error estimate for backward differentiation formulas. Important ingredients in our convergence analysis are stability bounds for non-autonomous linear problems that are obtained by perturbation techniques.     

2-Groupe des classes positives d'un corps de nombres et noyau sauvage de la K-théorie

We compute the 2-rank of the wild kernel WK₂(F) of a number field by constructing a 2-class group ad hoc. The main result generalizes in the more intricate case the canonical isomorphism established for odd primes under the assumption in a previous article (cf. (Acta. Arith. 67 (1994) 335; Math. Z. 238 (2001) 335)). It involves a criterium of triviality for the 2-part of the wild kernel of Galois number fields and, in the particular case of quadratic fields, it leads to a logarithmic interpretation of the diophantine conditions obtained by other authors.     

On the periodic nature of the solutions of the reciprocal difference equation with maximum

We prove that every positive solution of the third order difference equation

     

The decay rate for a fractional differential equation

We consider the fractional differential equation

     

Curves of positive solutions of boundary value problems on time-scales

Let TR be a time-scale, with a=infT, b=supT. We consider the nonlinear boundary value problem

(2)

(4)

u(a)=u(b)=0,