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.     

Block‐Transitive and Point‐Primitive 2‐ Designs with Sporadic Socle

The purpose of this paper is to classify all pairs , where is a nontrivial 2‐ design, and acts transitively on the set of blocks of and primitively on the set of points of with sporadic socle. We prove that there exists only one such pair : is the unique 2‐(176,8,2) design and , the Higman–Sims simple group.     

On the Existence of

Let there is an . For or , has been determined by Hanani, and for or , has been determined by the first author. In this paper, we investigate the case . A necessary condition for is . It is known that , and that there is an for all with a possible exception . We need to consider the case . It is proved that there is an for all with an exception and a possible exception , thereby, .     

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.     

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 .     

Liouville theorems for the weighted Lane–Emden equation with finite Morse indices

In this paper, we study the nonexistence result for the weighted Lane–Emden equation: (0.1) and the weighted Lane–Emden equation with nonlinear Neumann boundary condition: (0.2) where f(|x|) and g(|x|) are the radial and continuously differential functions, is an upper half space in , and . Using the method of energy estimation and the Pohozaev identity of solution, we prove the nonexistence of the nontrivial solutions to problems 0.1 and 0.2 under appropriate assumptions on f(|x|) and g(|x|). Copyright © 2017 John Wiley & Sons, Ltd.     

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 .     

On Flag‐Transitive Symmetric Designs of Affine Type

It is shown that, if is a nontrivial 2‐ symmetric design, with , admitting a flag‐transitive automorphism group G of affine type, then , p an odd prime, and G is a point‐primitive, block‐primitive subgroup of . Moreover, acts flag‐transitively, point‐primitively on , and is isomorphic to the development of a difference set whose parameters and structure are also provided.     

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.     

Existence of positive solutions for integral boundary value problems of fractional differential equations on infinite interval

In this paper, we consider a class of nonlinear fractional differential equations on the infinite interval with the integral boundary conditions By using Krasnoselskii fixed point theorem, the existence results of positive solutions for the boundary value problem in three cases and , are obtained, respectively. We also give out two corollaries as applications of the existence theorems and some examples to illustrate our results. Copyright © 2016 John Wiley & Sons, Ltd.     

Multi‐to One‐Dimensional Optimal Transport

We consider the Monge‐Kantorovich problem of transporting a probability density on to another on the line, so as to optimize a given cost function. We introduce a nestedness criterion relating the cost to the densities, under which it becomes possible to solve this problem uniquely by constructing an optimal map one level set at a time. This map is continuous if the target density has connected support. We use level‐set dynamics to develop and quantify a local regularity theory for this map and the Kantorovich potentials solving the dual linear program. We identify obstructions to global regularity through examples. More specifically, fix probability densities f and g on open sets and with . Consider transporting f onto g so as to minimize the cost . We give a nondegeneracy condition on that ensures the set of x paired with [g‐a.e.] y ∈ Y lie in a codimension‐n submanifold of X. Specializing to the case m > n = 1, we discover a nestedness criterion relating s to (f,g) that allows us to construct a unique optimal solution in the form of a map . When and g and f are bounded, the Kantorovich dual potentials (u,υ) satisfy , and the normal velocity V of with respect to changes in y is given by . Positivity of V locally implies a Lipschitz bound on f; moreover, if intersects transversally. On subsets where this nondegeneracy, positivity, and transversality can be quantified, for each integer the norms of and are controlled by these bounds, , and the smallness of . We give examples showing regularity extends from $X to part of , but not from Y to . We also show that when s remains nested for all (f,g), the problem in reduces to a supermodular problem in . © 2017 Wiley Periodicals, Inc.     

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.     

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 .     

Almost‐spanning universality in random graphs

A graph G is said to be ‐universal if it contains every graph on at most n vertices with maximum degree at most Δ. It is known that for any and any natural number Δ there exists such that the random graph G(n, p) is asymptotically almost surely ‐universal for . Bypassing this natural boundary, we show that for the same conclusion holds when . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 380–393, 2017     

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 .     

A Hypercube Variant with Small Diameter

This article introduces a new variant of hypercubes . The n‐dimensional twisted hypercube is obtained from two copies of the ‐dimensional twisted hypercube by adding a perfect matching between the vertices of these two copies of . We prove that the n‐dimensional twisted hypercube has diameter . This improves on the previous known variants of hypercube of dimension n and is optimal up to an error of order . Another type of hypercube variant that has similar structure and properties as is also discussed in the last section.     

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.     

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.     

Multiple sign‐changing solutions for a class of quasilinear elliptic equations

In this paper, we study the following quasilinear Schrödinger equations: where Ω is a bounded smooth domain of , . Under some suitable conditions, we prove that this equation has three solutions of mountain pass type: one positive, one negative, and sign‐changing. Furthermore, if g is odd with respect to its second variable, this problem has infinitely many sign‐changing solutions. Copyright © 2016 John Wiley & Sons, Ltd.     

On the existence of positive least energy solutions for a coupled Schrödinger system with critical exponent

In this paper, we consider the following coupled Schrödinger system with critical exponent: where is a smooth bounded domain, λ > 0,μ≥0, and . Under certain conditions on λ and μ, we show that this problem has at least one positive least energy solution. Copyright © 2016 John Wiley & Sons, Ltd.