Invariant tori of nonlinear Schrödinger equation

In this paper, we consider one-dimensional nonlinear Schrödinger equation iut−uxx+V(x)u+f(²|u|)u=0 on [0,π]×R under the boundary conditions a₁u(t,0)−b₁ux(t,0)=0, a₂u(t,π)+b₂ux(t,π)=0, , for i=1,2. It is proved that for a prescribed and analytic positive potential V(x), the above equation admits small-amplitude quasi-periodic solutions corresponding to d-dimensional invariant tori of the associated infinite-dimensional dynamical system.     

Linear layouts measuring neighbourhoods in graphs

In this paper we introduce the graph layout parameter neighbourhood-width as a variation of the well-known cut-width. The cut-width of a graph G=(V,E) is the smallest integer k, such that there is a linear layout ?:V→{1,…,|V|}, such that for every 1?i<|V| there are at most k edges {u,v} with ?(u)?i and ?(v)>i. The neighbourhood-width of a graph is the smallest integer k, such that there is a linear layout ?, such that for every 1?i<|V| the vertices u with ?(u)?i can be divided into at most k subsets each members having the same neighbourhood with respect to the vertices v with ?(v)>i.We show that the neighbourhood-width of a graph differs from its linear clique-width or linear NLC-width at most by one. This relation is used to show that the minimization problem for neighbourhood-width is NP-complete.Furthermore, we prove that simple modifications of neighbourhood-width imply equivalent layout characterizations for linear clique-width and linear NLC-width.We also show that every graph of path-width k or cut-width k has neighbourhood-width at most k+2 and we give several conditions such that graphs of bounded neighbourhood-width have bounded path-width or bounded cut-width.     

Existence of three positive pseudo-symmetric solutions for a one dimensional p-Laplacian

We apply the Five Functionals Fixed Point Theorem to verify the existence of at least three positive pseudo-symmetric solutions for the three point boundary value problem, (g(u′))′+a(t)f(u)=0, u(0)=0, and u(ν)=u(1), where g(v)=|v|^p−2v, with p>1 and ν∈(0,1).     

Isolated singularities for weighted quasilinear elliptic equations

We classify all the possible asymptotic behavior at the origin for positive solutions of quasilinear elliptic equations of the form div(|∇u|^p−2∇u)=b(x)h(u) in Ω?{0}, where 1<p?N and Ω is an open subset of RN with 0∈Ω. Our main result provides a sharp extension of a well-known theorem of Friedman and Véron for h(u)=uq and b(x)≡1, and a recent result of the authors for p=2 and b(x)≡1. We assume that the function h is regularly varying at ∞ with index q (that is, limt→∞h(λt)/h(t)=λq for every λ>0) and the weight function b(x) behaves near the origin as a function b₀(|x|) varying regularly at zero with index θ greater than −p. This condition includes b(x)=θ|x| and some of its perturbations, for instance, b(x)=θ|x|m(−log|x|) for any m∈R. Our approach makes use of the theory of regular variation and a new perturbation method for constructing sub- and super-solutions.     

Estimates for Emden-Fowler type inequalities with absorption term

We obtain improved estimates of the Keller-Osserman type for second-order elliptic semilinear inequalities in the non-divergent form sign(u)(aij(x)uxixj+bi(x)uxi)?c(x)⁻²|x|σ|u|. Special cases of rapidly growing or decaying weights c(x) and planar domains are also treated.     

Existence and comparison theorems for nonlinear diffusion systems

In this paper we prove existence, uniqueness, and regularity results for systems of nonlinear second order parabolic equations with boundary conditions of the Dirichlet, Neumann, and regular oblique derivative types. Let K(t) consist of all functions (v¹(x), v²(x),…, v^m(x)) from $\text{Ω ? R}{}^{\mathrm{n}}$ into R^m which satisfy ψⁱ(x, t) ? vⁱ(x) ? θⁱ(x, t) for all $\text{x ? Ω}\text{and}\text{1 ? i ? m}$, where ψⁱand θⁱ are extended real-valued functions on $\text{}\text{?}\text{gW × [0, T)}$. We find conditions which will ensure that a solution U(x, t) ≡ (u¹(x, t), u²(x, t),…, u^m(x, t)) which satisfies U(x, 0) ?K(0) will also satisfy U(x, t) ?K(t) for all 0 ? t < T. This result, which has some similarity to the Gronwall Inequality, is then used to prove a global existence theorem.     

Existence of three positive solutions for boundary value problems with p-Laplacian

By using fixed point theorem, we study the following equation g(u^′′(t))+a(t)f(u)=0 subject to boundary conditions, where g(v)=|v|^p−2v with p>1; the existence of at least three positive solutions is proved.     

Coincidence sets in quasilinear elliptic problems of monostable type

This paper concerns the formation of a coincidence set for the positive solution of the boundary value problem: −εΔpu=uq−1f(a(x)−u) in Ω with u=0 on ∂Ω, where ε is a positive parameter, Δpu=div(|∇u|^p−2∇u), 1<q?p<∞, f(s)∼|s|^θ−1s(s→0) for some θ>0 and a(x) is a positive smooth function satisfying Δpa=0 in Ω with infΩ|∇a|>0. It is proved in this paper that if 0<θ<1 the coincidence set Oε={x∈Ω:uε(x)=a(x)} has a positive measure for small ε and converges to Ω with order O(ε1/p) as ε→0. Moreover, it is also shown that if θ?1, then Oε is empty for any ε>0. The proofs rely on comparison theorems and the energy method for obtaining local comparison functions.     

A stochastic Ramsey theorem

We establish a stochastic extension of Ramsey's theorem. Any Markov chain generates a filtration relative to which one may define a notion of stopping times. A stochastic colouring is any k-valued (k<∞) colour function defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time θ and any infinite history ω of the Markov chain, let ω|θ denote the finite partial history up to and including the time θ(ω). Given k=2, for every ?>0, we prove that there is an increasing sequence θ₁<θ₂<? of bounded stopping times having the property that, with probability greater than 1−?, the history ω is such that the values assigned to all pairs (ω|θi,θj), with i<j, are the same. Just as with the classical Ramsey theorem, we also obtain an analogous finitary stochastic Ramsey theorem. Furthermore, with appropriate finiteness assumptions, the time one must wait for the last stopping time (in the finitary case) is uniformly bounded, independently of the probability transitions. We generalise the results to any finite number k of colours.     

On the classification of minimal mass blowup solutions of the focusing mass-critical Hartree equation

Consider the focusing mass-critical nonlinear Hartree equation iut+Δu=−(⁻²|⋅|∗²|u|)u for spherically symmetric initial data with ground state mass M(Q) in dimension d?5. We show that any global solution u which does not scatter must be the solitary wave eitQ up to phase rotation and scaling.     

Smoothing properties for a coupled system of nonlinear evolution dispersive equations

We study the smoothness properties of solutions to the coupled system of equations of Korteweg—de Vries type. We show that the equations dispersive nature leads to a gain in regularity for the solution. In particular, if the initial data (u₀, v₀ possesses certain regularity and sufficient decay as x → ∞, then the solution (u(t). v(t)) will be smoother than (u0, v0) for 0 < t ≤ T where T is the existence time of the solution.     

Doubly nonlinear periodic problems with unbounded operators

The solvability of the evolution system v′(t)+B(t)u(t)∋f(t), v(t)∈A(t)u(t), 0<t<T, with the periodic condition v(0)=v(T) is investigated in the case where are bounded, possibly degenerate, subdifferentials and are unbounded subdifferentials.     

A New Approach to the Creation and Propagation of Exponential Moments in the Boltzmann Equation

We study the creation and propagation of exponential moments of solutions to the spatially homogeneous d-dimensional Boltzmann equation. In particular, when the collision kernel is of the form |v ? v _*|^β b(cos (θ)) for β ∈ (0, 2] with cos (θ) = |v ? v _*|^?1(v ? v _*)·σ and σ ∈ 𝕊 ^d?1, and assuming the classical cut-off condition b(cos (θ)) integrable in 𝕊 ^d?1, we prove that there exists a > 0 such that moments with weight exp (amin {t, 1}|v|^β) are finite for t > 0, where a only depends on the collision kernel and the initial mass and energy. We propose a novel method of proof based on a single differential inequality for the exponential moment with time-dependent coefficients.     

Global existence and blowup for sign-changing solutions of the nonlinear heat equation

In this paper, given 0<α<2/N, we prove the existence of a function ψ with the following properties. The solution of the equation ut−Δu=α|u|u on RN with the initial condition u(0)=ψ is global. On the other hand, the solution with the initial condition u(0)=λψ blows up in finite time if λ>0 is either sufficiently small or sufficiently large.     

Graph parameters measuring neighbourhoods in graphs—Bounds and applications

The neighbourhood-width of a graph G=(V,E) is introduced in [F. Gurski, Linear layouts measuring neighbourhoods in graphs, Discrete Math. 306 (15) (2006) 1637-1650.] as the smallest integer k such that there is a linear layout ?:V→{1,…,|V|} such that for every 1?i<|V| the vertices u with ?(u)?i can be divided into at most k subsets each members having the same neighbours with respect to the vertices v with ?(v)>i.In this paper we show first bounds for the neighbourhood-width of general graphs, caterpillars, trees and grid graphs and give applications of the layout parameter neighbourhood-width in graph drawing and VLSI design.     

A generalization of Fan’s results: Distribution of cycle lengths in graphs

Fan [G. Fan, Distribution of cycle lengths in graphs, J. Combin. Theory Ser. B 84 (2002) 187-202] proved that if G is a graph with minimum degree δ(G)≥3k for any positive integer k, then G contains k+1 cycles C₀,C₁,…,C_k such that k+1<|E(C₀)|<|E(C₁)|<?<|E(C_k)|, |E(C_i)−E(C_i−1)|=2, 1≤i≤k−1, and 1≤|E(C_k)|−|E(C_k−1)|≤2, and furthermore, if δ(G)≥3k+1, then |E(C_k)|−|E(C_k−1)|=2. In this paper, we generalize Fan’s result, and show that if we let G be a graph with minimum degree δ(G)≥3, for any positive integer k (if k≥2, then δ(G)≥4), if d_G(u)+d_G(v)≥6k−1 for every pair of adjacent vertices u,v∈V(G), then G contains k+1 cycles C₀,C₁,…,C_k such that k+1<|E(C₀)|<|E(C₁)|<?<|E(C_k)|, |E(C_i)−E(C_i−1)|=2, 1≤i≤k−1, and 1≤|E(C_k)|−|E(C_k−1)|≤2, and furthermore, if d_G(u)+d_G(v)≥6k+1, then |E(C_k)|−|E(C_k−1)|=2.     

Properties of non-simultaneous blow-up in heat equations coupled via different localized sources

This paper deals with u_t = Δu + u^m(x, t)e^pv(0,t), v_t = Δv + u^q(0, t)e^nv(x,t), subject to homogeneous Dirichlet boundary conditions. The complete classification on non-simultaneous and simultaneous blow-up is obtained by four sufficient and necessary conditions. It is interesting that, in some exponent region, large initial data u₀(v₀) leads to the blow-up of u(v), and in some betweenness, simultaneous blow-up occurs. For all of the nonnegative exponents, we find that u(v) blows up only at a single point if m > 1(n > 0), while u(v) blows up everywhere for 0 ? m ? 1 (n = 0). Moreover, blow-up rates are considered for both non-simultaneous and simultaneous blow-up solutions.     

Periodic solutions of nonlinear delay equations

Existence and uniqueness of 2π-periodic solutions of $\text{d}{}^{\mathrm{j}}\text{x(t)}\text{dt}{}^{\mathrm{j}}\text{+}\text{grad}\text{G(x(t ? τ)) = e(t, x(t), x(t ? τ)) (j = 1, 2)}$, where x(t) is in $\text{R}$ⁿ and e(t, u, v) is a given vector function, 2π-periodic in t, are shown under conditions on the spectrum of the Hessian of G. The equation is studied using a fixed point theorem in the space L²(0, 2π). One feature of this approach is that no relationship between the delay and the period is necessary.     

Greedy F-colorings of graphs

Let G=(V,E) be a connected graph. For a symmetric, integer-valued function δ on V×V, where K is an integer constant, N₀ is the set of nonnegative integers, and Z is the set of integers, we define a C-mapping by F(u,v,m)=δ(u,v)+m−K. A coloring c of G is an F-coloring if F(u,v,|c(u)−c(v)|)?0 for every two distinct vertices u and v of G. The maximum color assigned by c to a vertex of G is the value of c, and the F-chromatic number F(G) is the minimum value among all F-colorings of G. For an ordering of the vertices of G, a greedy F-coloring c of s is defined by (1) c(v₁)=1 and (2) for each i with 1?i<n, c(v_i+1) is the smallest positive integer p such that F(v_j,v_i+1,|c(v_j)−p|)?0, for each j with 1?j?i. The greedy F-chromatic number gF(s) of s is the maximum color assigned by c to a vertex of G. The greedy F-chromatic number of G is gF(G)=min{gF(s)} over all orderings s of V. The Grundy F-chromatic number is GF(G)=max{gF(s)} over all orderings s of V. It is shown that gF(G)=F(G) for every graph G and every F-coloring defined on G. The parameters gF(G) and GF(G) are studied and compared for a special case of the C-mapping F on a connected graph G, where δ(u,v) is the distance between u and v and .