Asymptotic Behavior for a Class of Solutions to the Critical Modified Zakharov–Kuznetsov Equation

We consider the initial value problem (IVP) associated to the modified Zakharov–Kuznetsov (mZK) equation which is known to have global solution for given data in satisfying , where φ is a solitary wave solution. In this work, the issue of the asymptotic behavior of the solutions of the modified Zakharov–Kuznetsov equation with negative energy is addressed. The principal tool to obtain the main result is the use of appropriate scaling argument from Angulo et al. [ 1 , 2 ].     

Painlevé XXXIV Asymptotics of Orthogonal Polynomials for the Gaussian Weight with a Jump at the Edge

We study the uniform asymptotics of the polynomials orthogonal with respect to analytic weights with jump discontinuities on the real axis, and the influence of the discontinuities on the asymptotic behavior of the recurrence coefficients. The Riemann–Hilbert approach, also termed the Deift–Zhou steepest descent method, is used to derive the asymptotic results. We take as an example the perturbed Gaussian weight , where θ(x) takes the value of 1 for x < 0 , and a nonnegative complex constant ω elsewhere, and as . That is, the jump occurs at the edge of the support of the equilibrium measure. The derivation is carried out in the sense of a double scaling limit, namely, and . A crucial local parametrix at the edge point where the jump occurs is constructed out of a special solution of the Painlevé XXXIV equation. As a main result, we prove asymptotic formulas of the recurrence coefficients in terms of a special Painlevé XXXIV transcendent under the double scaling limit. The special thirty‐fourth Painlevé transcendent is shown free of poles on the real axis. A consistency check is made with the reduced case when ω= 1 , namely the Gaussian weight: the polynomials in this case are the classical Hermite polynomials. A comparison is also made of the asymptotic results for the recurrence coefficients between the case when the jump happens at the edge and the case with jump inside the support of the equilibrium measure. The comparison provides a formal asymptotic approximation of the Painlevé XXXIV transcendent at positive infinity.     

Hodograph‐Type Transformations for Linearization of Systems of Nonlinear Diffusion Equations

In this paper, we study the problem of linearization of nonlinear systems of equations which is a potential form of systems of nonlinear diffusion equations We construct a class of point transformations of the form which connects the nonlinear systems with linear systems of equations . These point transformations are hodograph‐type transformations which have the property that the new independent and dependent variables depend, respectively, on the old dependent and independent variables. All systems of equations admitting such transformations are completely classified.     

DERIVATION OF TWO WELL‐BEHAVED THEORETICAL CONTAGION INDICES AND THEIR SAMPLING PROPERTIES AND APPLICATION FOR ASSESSING FOREST LANDSCAPE DIVERSITY

Abstract Studies of spatial patterns of landscapes are useful to quantify human impact, predict wildlife effects, or describe variability of landscape features. A common approach to identify and quantify landscape structure is with a landscape scale model known as a contagion index. A contagion index quantifies two distinct components of landscape diversity: composition and configuration. Some landscape ecologists promote the use of relative contagion indices. It is demonstrated that relativized contagion indices are mathematically untenable. Two new theoretical contagion indices, Γ₁ and Γ₂ , are derived using a mean value approach (i.e., statistical expected value) instead of entropy. Behavior of Γ₁ and Γ₂ was investigated with simulated random, uniform, and aggregated landscapes. They are shown to be well‐behaved and sensitive to composition and configuration. Distributional properties of and are derived. They are shown to be asymptotically unbiased, consistent, and asymptotically normally distributed. Variance formulas for and are developed using the delta method. The new index models are used to examine landscape diversity on three physiographic provinces in Alabama by analyzing the pattern and changes in forest cover types over the recent past. In comparing and , use of in analysis of variance gave a more conservative test of contagion.     

Long Nonlinear Surface Waves in the Presence of a Variable Current

We investigate the eigenvalue problem governing the propagation of long nonlinear surface waves when there is a current beneath the surface, y being the vertical coordinate. The amplitude of such waves evolves according to the KdV equation and it was proved by Burns [ 1 ] that their speed of propagation c is such that there is no critical layer (i.e., c lies outside the range of ). If, however, the critical layer is nonlinear, the result of Burns does not necessarily apply because the phase change of linear theory then vanishes. In this paper, we consider specific velocity profiles and determine c as a function of Froude number for modes with nonlinear critical layers. Such modes do not always exist, the case of the asymptotic suction profile being a notable example. We find, however, that singular modes can be obtained for boundary layer profiles of the Falkner–Skan similarity type, including the Blasius case. These and other examples are treated and we examine singular solutions of the Rayleigh equation to gain insight about the long wave limit of such solutions.     

Eigenfunctions and Very Singular Similarity Solutions of Odd‐Order Nonlinear Dispersion PDEs: Toward a “Nonlinear Airy Function” and Others

Asymptotic properties of nonlinear dispersion equations (1) with fixed exponents n > 0 and p > n+ 1 , and their (2k+ 1) th‐order analogies are studied. The global in time similarity solutions, which lead to “nonlinear eigenfunctions” of the rescaled ordinary differential equations (ODEs), are constructed. The basic mathematical tools include a “homotopy‐deformation” approach, where the limit in the first equation in ( 1 ) turns out to be fruitful. At n= 0 the problem is reduced to the linear dispersion one: whose oscillatory fundamental solution via Airy’s classic function has been known since the nineteenth century. The corresponding Hermitian linear non‐self‐adjoint spectral theory giving a complete countable family of eigenfunctions was developed earlier in [ 1 ]. Various other nonlinear operator and numerical methods for ( 1 ) are also applied. As a key alternative, the “super‐nonlinear” limit , with the limit partial differential equation (PDE) admitting three almost “algebraically explicit” nonlinear eigenfunctions, is performed. For the second equation in ( 1 ), very singular similarity solutions (VSSs) are constructed. In particular, a “nonlinear bifurcation” phenomenon at critical values {p=p_l(n)}_l≥0 of the absorption exponents is discussed.     

Maximum number of colorings of (2k,k2)‐graphs

Let consist of all simple graphs on 2k vertices and edges. For a simple graph G and a positive integer , let denote the number of proper vertex colorings of G in at most colors, and let . We prove that and is the only extremal graph. We also prove that as . © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 135–148, 2007     

Disjoint cycles with chords in graphs

Let be integers, , , and let for each , be a cycle or a tree on vertices. We prove that every graph G of order at least n with contains k vertex disjoint subgraphs , where , if is a tree, and is a cycle with chords incident with a common vertex, if is a cycle. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 87–98, 2009     

Cutting two graphs simultaneously

Consider two graphs, and , on the same vertex set V, with and having edges for . We give a simple algorithm that partitions V into sets A and B such that and . We also show, using a probabilistic method, that if and belong to certain classes of graphs, (for instance, if and both have a density of at least 2/, or if and are both regular of degree at most with n sufficiently large) then we can find a partition of V into sets A and B such that for . © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 19–32, 2008     

Ore‐type condition for the existence of connected factors

In this article, we obtain some Ore‐type sufficient conditions for a graph to have a connected factor with degree restrictions. Let α and k be positive integers with if and if . Let G be a connected graph with a spanning subgraph F, each component of which has order at least α. We show that if the degree sum of two nonadjacent vertices is greater than then G has a connected subgraph in which F is contained and every vertex has degree at most . From the result, we derive that a graph G has a connected ‐factor if the degree sum of two nonadjacent vertices is at least . © Wiley Periodicals, Inc. J. Graph Theory 56: 241–248, 2007     

The size of edge chromatic critical graphs with maximum degree 6

In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph with maximum degree , . This conjecture has been verified for . In this article, by applying the discharging method, we prove the conjecture for . © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 149–171, 2009     

Enumeration of generalized Hadamard matrices of order 16 and related designs

We investigate signings of symmetric GDD( , 16, )s over for . Beginning with , at each stage of this process a signing of a GDD( , 16, ) produces a GDD( , 16, ). The initial GDDs ( ) correspond to Hadamard matrices of order 16. For , the GDDs are semibiplanes of order 16, and for the GDDs are semiplanes of order 16 which can be extended to projective planes of order 16. In this article, we completely enumerate such signings which include all generalized Hadamard matrices of order 16. We discuss the generation techniques and properties of the designs obtained during the search. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 119–135, 2009     

Circular chromatic index of Cartesian products of graphs

The circular chromatic index of a graph G, written , is the minimum r permitting a function such that whenever e and are incident. Let □ , where □ denotes Cartesian product and H is an ‐regular graph of odd order, with (thus, G is s‐regular). We prove that , where is the minimum, over all bases of the cycle space of H, of the maximum length of a cycle in the basis. When and m is large, the lower bound is sharp. In particular, if , then □ , independent of m. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 7–18, 2008     

On the existence of a rainbow 1‐factor in 1‐factorizations of K

Let be a 1‐factorization of the complete uniform hypergraph with and . We show that there exists a 1‐factor of whose edges belong to n different 1‐factors in . Such a 1‐factor is called a “rainbow” 1‐factor or an “orthogonal” 1‐factor. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 487–490, 2007     

A system of equations for describing cocyclic Hadamard matrices

Given a basis for 2‐cocycles over a group G of order , we describe a nonlinear system of 4t‐1 equations and k indeterminates over , whose solutions determine the whole set of cocyclic Hadamard matrices over G, in the sense that ( ) is a solution of the system if and only if the 2‐cocycle gives rise to a cocyclic Hadamard matrix . Furthermore, the study of any isolated equation of the system provides upper and lower bounds on the number of coboundary generators in which have to be combined to form a cocyclic Hadamard matrix coming from a special class of cocycles. We include some results on the families of groups and . A deeper study of the system provides some more nice properties. For instance, in the case of dihedral groups , we have found that it suffices to check t instead of the 4t rows of , to decide the Hadamard character of the matrix (for a special class of cocycles f). © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 276–290, 2008     

The cover time of random geometric graphs

We study the cover time of random geometric graphs. Let $I(d)=[0,1]^{d}$ denote the unit torus in d dimensions. Let $D(x,r)$ denote the ball (disc) of radius r. Let $\Upsilon_d$ be the volume of the unit ball $D(0,1)$ in d dimensions. A random geometric graph $G=G(d,r,n)$ in d dimensions is defined as follows: Sample n points V independently and uniformly at random from $I(d)$ . For each point x draw a ball $D(x,r)$ of radius r about x. The vertex set $V(G)=V$ and the edge set $E(G)=\{\{v,w\}: w\ne v,\,w\in D(v,r)\}$ . Let $G(d,r,n),\,d\geq 3$ be a random geometric graph. Let $C_G$ denote the cover time of a simple random walk on G. Let $c>1$ be constant, and let $r=(c\log n/(\Upsilon_dn))^{1/d}$ . Then whp the cover time satisfies © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 324–349, 2011     

A note on complete subdivisions in digraphs of large outdegree

Mader conjectured that for all there is an integer such that every digraph of minimum outdegree at least contains a subdivision of a transitive tournament of order . In this note, we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let be a digraph of order n whose minimum outdegree is at least d. Then contains a subdivision of a complete digraph of order . © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 1–6, 2008     

Graph classes characterized both by forbidden subgraphs and degree sequences

Given a set of graphs, a graph G is ‐free if G does not contain any member of as an induced subgraph. We say that is a degree‐sequence‐forcing set if, for each graph G in the class of ‐free graphs, every realization of the degree sequence of G is also in . We give a complete characterization of the degree‐sequence‐forcing sets when has cardinality at most two. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 131–148, 2008     

Tangency sets in PG(3, q)

A tangency set of PG (d,q) is a set Q of points with the property that every point P of Q lies on a hyperplane that meets Q only in P. It is known that a tangency set of PG (3,q) has at most points with equality only if it is an ovoid. We show that a tangency set of PG (3,q) with , or points is contained in an ovoid. This implies the non‐existence of minimal blocking sets of size , , and of with respect to planes in PG (3,q), and implies the extendability of partial 1‐systems of size , , or to 1‐systems on the hyperbolic quadric . © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 462–476, 2008     

A S(3, {4, 6}, 18) with a subdesign S(3, 4, 8) does not exist

For , a S(t,K,v) design is a pair, , with |V| = v and a set of subsets of V such that each t‐subset of V is contained in a unique and for all . If , , , and is a S(t,K,u) design, then we say has a subdesign on U. We show that a S(3,{4,6},18) design with a subdesign S(3,4,8) does not exist. © 2007 Wiley Periodicals, Inc. J Combin Designs 17: 36–38, 2009