Integrability of a SIS model

We prove that the classical model of an infectious disseise, which never kills and which does not induce autoimmunity, is integrable. This model can be written as x^′=−bxy−mx+cy+mk, y^′=bxy−(m+c)y with parameters b,c,k,m∈R. We provide the explicit expression of its first integrals and of the set of all its invariant algebraic curves.     

Distance-hereditary graphs and signpost systems

An ordered pair (U,R) is called a signpost system if U is a finite nonempty set, R⊆U×U×U, and the following axioms hold for all u,v,w∈U: (1) if (u,v,w)∈R, then (v,u,u)∈R; (2) if (u,v,w)∈R, then (v,u,w)∉R; (3) if u≠v, then there exists t∈U such that (u,t,v)∈R. (If F is a (finite) connected graph with vertex set U and distance function d, then U together with the set of all ordered triples (u,v,w) of vertices in F such that d(u,v)=1 and d(v,w)=d(u,w)−1 is an example of a signpost system). If (U,R) is a signpost system and G is a graph, then G is called the underlying graph of (U,R) if V(G)=U and xy∈E(G) if and only if (x,y,y)∈R (for all x,y∈U). It is possible to say that a signpost system shows a way how to travel in its underlying graph. The following result is proved: Let (U,R) be a signpost system and let G denote the underlying graph of (U,R). Then G is connected and every induced path in G is a geodesic in G if and only if (U,R) satisfies axioms (4)-(8) stated in this paper; note that axioms (4)-(8)-similarly as axioms (1)-(3)-can be formulated in the language of the first-order logic.     

On the complexity of paths avoiding forbidden pairs

Given a graph G=(V,E), two fixed vertices s,t∈V and a set F of pairs of vertices (called forbidden pairs), the problem of a path avoiding forbidden pairs is to find a path from s to t that contains at most one vertex from each pair in F. The problem is known to be NP-complete in general and a few restricted versions of the problem are known to be in P. We study the complexity of the problem for directed acyclic graphs with respect to the structure of the forbidden pairs.We write x?y if and only if there exists a path from x to y and we assume, without loss of generality, that for every forbidden pair (x,y)∈F we have x?y. The forbidden pairs have a halving structure if no two pairs (u,v),(x,y)∈F satisfy v?x or v=x and they have a hierarchical structure if no two pairs (u,v),(x,y)∈F satisfy u?x?v?y. We show that the PAFP problem is NP-hard even if the forbidden pairs have the halving structure and we provide a surprisingly simple and efficient algorithm for the PAFP problem with the hierarchical structure.     

Coupled fixed point theorems for a generalized Meir-Keeler contraction in partially ordered metric spaces

Let X be a non-empty set and F:X×X→X be a given mapping. An element (x,y)∈X×X is said to be a coupled fixed point of the mapping F if F(x,y)=x and F(y,x)=y. In this paper, we consider the case when X is a complete metric space endowed with a partial order. We define generalized Meir-Keeler type functions and we prove some coupled fixed point theorems under a generalized Meir-Keeler contractive condition. Some applications of our obtained results are given. The presented theorems extend and complement the recent fixed point theorems due to Bhaskar and Lakshmikantham [T. Gnana Bhaskar, V. Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, Nonlinear Anal. 65 (2006) 1379-1393].     

Recurrent points and non-wandering points of graph maps

Let G be a graph and f:G→G be a continuous map. Denote by P(f), R(f) and Ω(f) the sets of periodic points, recurrent points and non-wandering points of f, respectively. In this paper we show that: (1) If L=(x,y) is an open arc contained in an edge of G such that {fm(x),fk(y)}⊂(x,y) for some m,k∈N, then R(f)∩(x,y)≠∅; (2) Any isolated point of P(f) is also an isolated point of Ω(f); (3) If x∈Ω(f)−Ω(fn) for some n∈N, then x is an eventually periodic point. These generalize the corresponding results in W. Huang and X. Ye (2001) [9] and J. Xiong (1983, 1986) [17] and [19] on interval maps or tree maps.     

Boundary regularity for viscosity solutions to degenerate elliptic PDEs

Sufficient conditions are given for the solutions to the (fully nonlinear, degenerate) elliptic equation F(x,u,Du,D²u)=0 in Ω to satisfy |u(x)−u(y)|?Cα|x−y| for some α∈(0,1) when x∈Ω and y∈∂Ω.     

Note on upper bound graphs and forbidden subposets

In the upper bound graph of a poset P, the vertex set is V(P) and xy is an edge if there exists an m∈V(P) with x,y≤_Pm. We show some characterizations on split upper bound graphs, threshold upper bound graphs and difference upper bound graphs in terms of m-subposets and canonical posets.     

Uniformity and inexact version of a proximal method for metrically regular mappings

We study stability properties of a proximal point algorithm for solving the inclusion 0∈T(x) when T is a set-valued mapping that is not necessarily monotone. More precisely we show that the convergence of our algorithm is uniform, in the sense that it is stable under small perturbations whenever the set-valued mapping T is metrically regular at a given solution. We present also an inexact proximal point method for strongly metrically subregular mappings and show that it is super-linearly convergent to a solution to the inclusion 0∈T(x).     

Rose window graphs underlying rotary maps

Given natural numbers n≥3 and 1≤a,r≤n−1, the rose window graph R_n(a,r) is a quartic graph with vertex set {x_i∣i∈Z_n}∪{y_i∣i∈Z_n} and edge set {{x_i,x_i+1}∣i∈Z_n}∪{{y_i,y_i+r}∣i∈Z_n}∪{{x_i,y_i}∣i∈Z_n}∪{{x_i+a,y_i}∣i∈Z_n}. In this paper rotary maps on rose window graphs are considered. In particular, we answer the question posed in [S. Wilson, Rose window graphs, Ars Math. Contemp. 1 (2008), 7-19. http://amc.imfm.si/index.php/amc/issue/view/5] concerning which of these graphs underlie a rotary map.     

Max-min of polynomials and exponential diophantine equations

In this paper we study the maximum-minimum value of polynomials over the integer ring Z. In particular, we prove the following: Let F(x,y) be a polynomial over Z. Then, maxx∈Z(T)miny∈Z|F(x,y)|=o(T1/2) as T→∞ if and only if there is a positive integer B such that maxx∈Zminy∈Z|F(x,y)|?B. We then apply these results to exponential diophantine equations and obtain that: Let f(x,y), g(x,y) and G(x,y) be polynomials over Q, G(x,y)∈(Q[x,y]−Q[x])∪Q, and b a positive integer. For every α in Z, there is a y in Z such that f(α,y)+g(α,y)bG(α,y)=0 if and only if for every integer α there exists an h(x)∈Q[x] such that f(x,h(x))+g(x,h(x))bG(x,h(x))≡0, and h(α)∈Z.     

On approximately additive functions

Let C be a convex symmetric subset of a real Banach space F and K be a subgroup of the group (F,+). Let E be a real linear space, h:E→F, and h(x+y)−h(x)−h(y)∈K+C for x,y∈E. We prove that under some additional assumptions h can be represented in the form: h=A+γ+κ with an additive (or linear) A:E→F and some γ:E→C, κ:E→K.     

Induced path transit function, monotone and Peano axioms

The induced path transit function J(u,v) in a graph consists of the set of all vertices lying on any induced path between the vertices u and v. A transit function J satisfies monotone axiom if x,y∈J(u,v) implies J(x,y)⊆J(u,v). A transit function J is said to satisfy the Peano axiom if, for any u,v,w∈V,x∈J(v,w), y∈J(u,x), there is a z∈J(u,v) such that y∈J(w,z). These two axioms are equivalent for the induced path transit function of a graph. Planar graphs for which the induced path transit function satisfies the monotone axiom are characterized by forbidden induced subgraphs.     

On h-convexity

We introduce a class of h-convex functions which generalize convex, s-convex, Godunova-Levin functions and P-functions. Namely, the h-convex function is defined as a non-negative function which satisfies f(αx+(1−α)y)?h(α)f(x)+h(1−α)f(y), where h is a non-negative function, α∈(0,1) and x,y∈J. Some properties of h-convex functions are discussed. Also, the Schur-type inequality is given.     

Indecomposability graph and critical vertices of an indecomposable graph

Given a directed graph G=(V,A), the induced subgraph of G by a subset X of V is denoted by G[X]. A subset X of V is an interval of G provided that for a,b∈X and x∈V?X, (a,x)∈A if and only if (b,x)∈A, and similarly for (x,a) and (x,b). For instance, 0?, V and {x}, x∈V, are intervals of G, called trivial intervals. A directed graph is indecomposable if all its intervals are trivial, otherwise it is decomposable. Given an indecomposable directed graph G=(V,A), a vertex x of G is critical if G[V?{x}] is decomposable. An indecomposable directed graph is critical when all its vertices are critical. With each indecomposable directed graph G=(V,A) is associated its indecomposability directed graph defined on V by: given x≠y∈V, (x,y) is an arc of if G[V?{x,y}] is indecomposable. All the results follow from the study of the connected components of the indecomposability directed graph. First, we prove: if G is an indecomposable directed graph, which admits at least two non critical vertices, then there is x∈V such that G[V?{x}] is indecomposable and non critical. Second, we characterize the indecomposable directed graphs G which have a unique non critical vertex x and such that G[V?{x}] is critical. Third, we propose a new approach to characterize the critical directed graphs.     

Convergence theorems for fixed points of uniformly continuous generalized Φ-hemi-contractive mappings

Let E be a real normed linear space, K be a nonempty subset of E and be a uniformly continuous generalized Φ-hemi-contractive mapping, i.e., , and there exist x^∗∈F(T) and a strictly increasing function , Φ(0)=0 such that for all x∈K, there exists j(x−x^∗)∈J(x−x^∗) such that

〈Tx−x^∗,j(x−x^∗)〉?‖x−x^∗‖2−Φ(‖x−x^∗‖).     

Properties of the density for a three-dimensional stochastic wave equation

We consider a stochastic wave equation in space dimension three driven by a noise white in time and with an absolutely continuous correlation measure given by the product of a smooth function and a Riesz kernel. Let pt,x(y) be the density of the law of the solution u(t,x) of such an equation at points (t,x)∈]0,T]×R³. We prove that the mapping (t,x)?pt,x(y) owns the same regularity as the sample paths of the process {u(t,x),(t,x)∈]0,T]×R³} established in [R.C. Dalang, M. Sanz-Solé, Hölder-Sobolev regularity of the solution to the stochastic wave equation in dimension three, Mem. Amer. Math. Soc., in press]. The proof relies on Malliavin calculus and more explicitly, the integration by parts formula of [S. Watanabe, Lectures on Stochastic Differential Equations and Malliavin Calculus, Tata Inst. Fund. Res./Springer-Verlag, Bombay, 1984] and estimates derived from it.     

Extensions of convex and semiconvex functions and intervally thin sets

We call A⊂RNintervally thin if for all x,y∈RN and ε>0 there exist x^′∈B(x,ε), y^′∈B(y,ε) such that [x^′,y^′]∩A=∅. Closed intervally thin sets behave like sets with measure zero (for example such a set cannot “disconnect” an open connected set). Let us also mention that if the (N−1)-dimensional Hausdorff measure of A is zero, then A is intervally thin. A function f is preconvex if it is convex on every convex subset of its domain. The consequence of our main theorem is the following: Let U be an open subset ofRNand let A be a closed intervally thin subset of U. Then every preconvex functioncan be uniquely extended (with preservation of preconvexity) onto U. In fact we show that a more general version of this result holds for semiconvex functions.     

Duality for a Class of Multiobjective Control Problems

In this paper, a class of multiobjective control problems is considered, where the objective and constraint functions involved are f(t, x(t), ?(t), y(t), z(t)) with x(t) ∈ Rⁿ, y(t) ∈ Rⁿ, and z(t) ∈ R^m, where x(t) and z(t) are the control variables and y(t) is the state variable. Under the assumption of invexity and its generalization, duality theorems are proved through a parametric approach to related properly efficient solutions of the primal and dual problems.     

On solvability of two-dimensional Lp-Minkowski problem

Given p≠0 and a positive continuous function g, with g(x+T)=g(x), for some 0<T<1 and all real x, it is shown that for suitable choice of a constant C>0 the functional has a minimizer in the class of positive functions u∈C¹(R) for which u(x+T)=u(x) for all x∈R. This minimizer is used to prove the existence of a positive periodic solution y∈C²(R) of two-dimensional L_p-Minkowski problem y^1−p(x)(y″(x)+y(x))=g(x), where p∉{0,2}.     

Boundary data smoothness for solutions of nonlocal boundary value problems for second order differential equations

Under certain conditions, solutions of the boundary value problem, y^″=f(x,y,y^′), y(x₁)=y₁, and , are differentiated with respect to boundary conditions, where a<x₁<η₁<?<ηm<x₂<b, r₁,…,rm∈R, and y₁,y₂∈R.