Ground state solutions for asymptotically periodic fractional Schrödinger–Poisson problems with asymptotically cubic or super‐cubic nonlinearities

In this paper, we consider the following fractional Schrödinger–Poisson problem: where s,t∈(0,1],4s+2t>3,V(x),K(x), and f(x,u) are periodic or asymptotically periodic in x. We use the non‐Nehari manifold approach to establish the existence of the Nehari‐type ground state solutions in two cases: the periodic one and the asymptotically periodic case, by introducing weaker conditions uniformly in with and with constant θ₀∈(0,1), instead of uniformly in and the usual Nehari‐type monotonic condition on f(x,τ)/|τ|³. Our results unify both asymptotically cubic or super‐cubic nonlinearities, which are new even for s=t=1. Copyright © 2017 John Wiley & Sons, Ltd.     

Asymptotics for the third‐order nonlinear Schrödinger equation in the critical case

We consider the Cauchy problem for the third‐order nonlinear Schrödinger equation where and is the Fourier transform. Our purpose in this paper is to prove the large time asymptoitic behavior of solutions for the defocusing case λ > 0 with a logarithmic correction under the non zero mass condition Copyright © 2016 John Wiley & Sons, Ltd.     

Regular wavelets and Triebel‐Lizorkin type oscillation spaces

In this paper, we apply wavelets to study the Triebel‐Lizorkin type oscillation spaces and identify them with the well‐known Triebel‐Lizorkin‐Morrey spaces. Further, we prove that Calderón‐Zygmund operators are bounded on .     

The Hamilton–Waterloo Problem for ‐Factors and ‐Factors

The Hamilton–Waterloo problem asks for a 2‐factorization of (for v odd) or minus a 1‐factor (for v even) into ‐factors and ‐factors. We completely solve the Hamilton–Waterloo problem in the case of C₃‐factors and ‐factors for .     

Petersen Cores and the Oddness of Cubic Graphs

Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. We study lists by three 1‐factors, and call with a ‐core of G. If G is not 3‐edge‐colorable, then . In Steffen (J Graph Theory 78 (2015), 195–206) it is shown that if , then is an upper bound for the girth of G. We show that bounds the oddness of G as well. We prove that . If , then every ‐core has a very specific structure. We call these cores Petersen cores. We show that for any given oddness there is a cyclically 4‐edge‐connected cubic graph G with . On the other hand, the difference between and can be arbitrarily big. This is true even if we additionally fix the oddness. Furthermore, for every integer , there exists a bridgeless cubic graph G such that .     

Global well‐posedness and blow‐up criterion for the periodic quasi‐geostrophic equations in Lei‐Lin‐Gevrey spaces

In this paper we consider a periodic 2‐dimensional quasi‐geostrophic equations with subcritical dissipation. We show the global existence and uniqueness of the solution for small initial data in the Lei‐Lin‐Gevrey spaces . Moreover, we establish an exponential type explosion in finite time of this solution.     

Wave solutions for variants of the KdV–Burger and the K(n,n)–Burger equations by the generalized G′/G‐expansion method

An application of the ‐expansion method to search for exact solutions of nonlinear partial differential equations is analyzed. This method is used for variants of the Korteweg–de Vries–Burger and the K(n,n)–Burger equations. The generalized ‐expansion method was used to construct periodic wave and solitary wave solutions of nonlinear evolution equations. This method is developed for searching exact traveling wave solutions of nonlinear partial differential equations. It is shown that the generalized ‐expansion method, with the help of symbolic computation, provides a straightforward and powerful mathematical tool for solving nonlinear problems. Copyright © 2017 John Wiley & Sons, Ltd.     

Unique Colorability and Clique Minors

For a graph G, let denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of size 1 or 2. Hadwiger 's conjecture states that , where is the chromatic number of G. Seymour conjectured for all graphs without antitriangles, that is,  three pairwise nonadjacent vertices. Here we concentrate on graphs G with exactly one ‐coloring. We prove generalizations of the following statements: (i) if and G has exactly one ‐coloring then , where the proof does not use the four‐color‐theorem, and (ii) if G has no antitriangles and G has exactly one ‐coloring then .     

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces

Let G be a 5‐connected triangulation of a surface Σ different from the sphere, and let be the Euler characteristic of Σ. Suppose that with even and M and N are two matchings in of sizes m and n respectively such that . It is shown that if the pairwise distance between any two elements of is at least five and the face‐width of the embedding of G in Σ is at least , then there is a perfect matching M₀ in containing M such that .     

Asymptotic behavior of solutions to a class of nonlocal non‐autonomous diffusion equations

In this paper, we consider the nonlocal non‐autonomous evolution problems where Ω is a bounded smooth domain in , N≥1, β is a positive constant, the coefficient a is a continuous bounded function on , and K is an integral operator with symmetric kernel , being J a non‐negative function continuously differentiable on and . We prove the existence of global pullback attractor, and we exhibit a functional to evolution process generated by this problem that decreases along of solutions. Assuming the parameter β is small enough, we show that the origin is locally pullback asymptotically stable. Copyright © 2014 John Wiley & Sons, Ltd.     

Solutions in Bessel‐potential spaces for wave equations with nonlinear damping

We consider a semilinear wave equation with nonlinear damping in the whole space . Local‐in‐time existence and uniqueness results are obtained in the class of Bessel‐potential spaces . Copyright © 2017 John Wiley & Sons, Ltd.     

The Game Saturation Number of a Graph

Given a family and a host graph H, a graph is ‐saturated relative to H if no subgraph of G lies in but adding any edge from to G creates such a subgraph. In the ‐saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in , until G becomes ‐saturated relative to H. They aim to maximize or minimize the length of the game, respectively; denotes the length under optimal play (when Max starts). Let denote the family of odd cycles and the family of n‐vertex trees, and write F for when . Our results include , for , for , and for . We also determine ; with , it is n when n is even, m when n is odd and m is even, and when is odd. Finally, we prove the lower bound . The results are very similar when Min plays first, except for the P₄‐saturation game on .     

Jacobsthal Numbers in Generalized Petersen Graphs

We prove that the number of 1‐factorizations of a generalized Petersen graph of the type is equal to the kth Jacobsthal number when k is odd, and equal to when k is even. Moreover, we verify the list coloring conjecture for .     

On the Hamilton–Waterloo Problem with Odd Orders

Given nonnegative integers , the Hamilton–Waterloo problem asks for a factorization of the complete graph into α ‐factors and β ‐factors. Without loss of generality, we may assume that . Clearly, v odd, , , and are necessary conditions. To date results have only been found for specific values of m and n. In this paper, we show that for any integers , these necessary conditions are sufficient when v is a multiple of and , except possibly when or 3. For the case where we show sufficiency when with some possible exceptions. We also show that when are odd integers, the lexicographic product of with the empty graph of order n has a factorization into α ‐factors and β ‐factors for every , , with some possible exceptions.     

Global stability of a multi‐group model with distributed delay and vaccination

A delayed multi‐group SVEIR epidemic model with vaccination and a general incidence function has been formulated and studied in this paper. Mathematical analysis shows that the basic reproduction number plays a key role in the dynamics of the model: the disease‐free equilibrium is globally asymptotically stable when , while the endemic equilibrium exists uniquely and is globally asymptotically stable when . For the proofs, we exploit a graph‐theoretical approach to the method of Lyapunov functionals. Our results show that distributed delay has no impact on the global stability of equilibria, and the results improve and generalize some known results. Copyright © 2016 John Wiley & Sons, Ltd.     

The periodic solution bifurcated from homoclinic orbit for coupled ordinary differential equations

We consider the problem of the periodic solutions bifurcated from a homoclinic orbit for a pair of coupled ordinary differential equations in . Assume that the autonomous system has a degenerate homoclinic solution γ in . A functional analytic approach is used to consider the existence of periodic solution for the autonomous system with periodic perturbations. By exponential dichotomies and the method of Lyapunov–Schmidt, the bifurcation function defined between two finite dimensional subspaces is obtained, where the zeros correspond to the existence of periodic solutions for the coupled ordinary differential equations near . Copyright © 2016 John Wiley & Sons, Ltd.     

Attractors for the strongly damped wave equation with p‐Laplacian

This paper is concerned with the initial‐boundary value problem for one‐dimensional strongly damped wave equation involving p‐Laplacian. For p > 2 , we establish the existence of weak local attractors for this problem in . Under restriction 2 < p < 4, we prove that the semigroup, generated by the considered problem, possesses a strong global attractor in , and this attractor is a bounded subset of . Copyright © 2017 John Wiley & Sons, Ltd.     

Global stability of a discrete multigroup SIR model with nonlinear incidence rate

In this paper, by applying nonstandard finite difference scheme, we propose a discrete multigroup Susceptible‐Infective‐Removed (SIR) model with nonlinear incidence rate. Using Lyapunov functions, it is shown that the global dynamics of this model are completely determined by the basic reproduction number . If , then the disease‐free equilibrium is globally asymptotically stable; if , then there exists a unique endemic equilibrium and it is globally asymptotically stable. Example and numerical simulations are presented to illustrate the results. Copyright © 2017 John Wiley & Sons, Ltd.     

Global solutions to Keller‐Segel‐Navier‐Stokes equations with a class of large initial data in critical Besov spaces

In this article, we consider the Cauchy problem to Keller‐Segel equations coupled to the incompressible Navier‐Stokes equations. Using the Fourier frequency localization and the Bony paraproduct decomposition, let u_F:=e^tΔu₀; we prove that there exist 2 positive constants σ₀ and C₀ such that if the gravitational potential and the initial data (u₀,n₀,c₀) satisfy for some p,q with and , then the global solutions can be established in critical Besov spaces.     

Saturation Numbers in Tripartite Graphs

Given graphs H and F, a subgraph is an F‐saturated subgraph of H if , but for all . The saturation number of F in H, denoted , is the minimum number of edges in an F‐saturated subgraph of H. In this article, we study saturation numbers of tripartite graphs in tripartite graphs. For and n₁, n₂, and n₃ sufficiently large, we determine and exactly and within an additive constant. We also include general constructions of ‐saturated subgraphs of with few edges for .