The regularity of the multiple higher-order poles solitons of the NLS equation

Based on the inverse scattering method, the formulae of one higher-order pole solitons and multiple higher-order poles solitons of the nonlinear Schrödinger equation (NLS) equation are obtained. Their denominators are expressed as , where is a matrix frequently constructed for solving the Riemann-Hilbert problem, and the asterisk denotes complex conjugate. We take two methods for proving is invertible. The first one shows matrix is equivalent to a self-adjoint Hankel matrix , proving . The second one considers the block-matrix form of , proving . In addition, we prove that the dimension of is equivalent to the sum of the orders of pole points of the transmission coefficient and its diagonal entries compose a set of basis.     

Using Symmetries à Rebours

We consider nonclassical symmetries of partial differential equations (PDEs) in dimensions. Given a th‐order ordinary differential equation in the unknown we are able to find the most general scalar PDE of a given order which can be reduced via a nonclassical symmetry to .     

Uniform asymptotics and zeros of the associated Pollaczek polynomials

Using a difference-equation method in a previous paper, we study the associated Pollaczek polynomials defined by a three-term recurrence relation. Two asymptotic approximations are derived for these polynomials; one holds for with and , and the other holds for with t in a neighborhood of . An asymptotic formula is also provided for their largest zeros.     

The Riemann–Hilbert analysis to the Pollaczek–Jacobi type orthogonal polynomials

In this paper, we study polynomials orthogonal with respect to a Pollaczek–Jacobi type weight The uniform asymptotic expansions for the monic orthogonal polynomials on the interval (0,1) and outside this interval are obtained. Moreover, near , the uniform asymptotic expansion involves Airy function as , and Bessel function of order α as in the neighborhood of , the uniform asymptotic expansion is associated with Bessel function of order β as . The recurrence coefficients and leading coefficient of the orthogonal polynomials are expressed in terms of a particular Painlevé III transcendent. We also obtain the limit of the kernel in the bulk of the spectrum. The double scaled logarithmic derivative of the Hankel determinant satisfies a σ‐form Painlevé III equation. The asymptotic analysis is based on the Deift and Zhou's steepest descent method.     

Stable blow-up dynamics in the -critical and -supercritical generalized Hartree equation

We study stable blow-up dynamics in the generalized Hartree equation with radial symmetry, which is a Schrödinger-type equation with a nonlocal, convolution-type nonlinearity: First, we consider the -critical case in dimensions and obtain that a generic blow-up has a self-similar structure and exhibits not only the square root blowup rate , but also the log-log correction (via asymptotic analysis and functional fitting), thus, behaving similarly to the stable blow-up regime in the -critical nonlinear Schrödinger equation. In this setting, we also study blow-up profiles and show that generic blow-up solutions converge to the rescaled , a ground state solution of the elliptic equation . We also consider the -supercritical case in dimensions . We derive the profile equation for the self-similar blow-up and establish the existence and local uniqueness of its solutions. As in the NLS -supercritical regime, the profile equation exhibits branches of nonoscillating, polynomially decaying (multi-bump) solutions. A numerical scheme of putting constraints into solving the corresponding ordinary differential equation is applied during the process of finding the multi-bump solutions. Direct numerical simulation of solutions to the generalized Hartree equation by the dynamic rescaling method indicates that the is the profile for the stable blow-up. In this supercritical case, we obtain the blow-up rate without any correction. This blow-up happens at the focusing level , and thus, numerically observable (unlike the -critical case). In summary, we find that the results are similar to the behavior of stable self-similar blowup solutions in the corresponding settings for the nonlinear Schrödinger equation. Consequently, one may expect that the form of the nonlinearity in the Schrödinger-type equations is not essential in the stable formation of singularities.     

Development and analysis of a malaria transmission mathematical model with seasonal mosquito life-history traits

In this paper, we develop and analyze a malaria model with seasonality of mosquito life-history traits: periodic-mosquitoes per capita birth rate, -mosquitoes death rate, -probability of mosquito to human disease transmission, -probability of human to mosquito disease transmission, and -mosquitoes biting rate. All these parameters are assumed to be time dependent leading to a nonautonomous differential equation system. We provide a global analysis of the model depending on two threshold parameters and (with ). When , then the disease-free stationary state is locally asymptotically stable. In the presence of the human disease-induced mortality, the global stability of the disease-free stationary state is guarantied when . On the contrary, if , the disease persists in the host population in the long term and the model admits at least one positive periodic solution. Moreover, by a numerical simulation, we show that a sub-critical (backward) bifurcation is possible at . Finally, the simulation results are in accordance with the seasonal variation of the reported cases of a malaria-epidemic region in Mpumalanga province in South Africa.     

Inverse scattering transform for the defocusing Ablowitz–Ladik system with arbitrarily large nonzero background

In this work we develop the inverse scattering transform (IST) for the defocusing Ablowitz–Ladik (AL) equation with arbitrarily a large nonzero background at space infinity. The IST was developed in previous works under the assumption that the amplitude of the background satisfies a “small norm” condition . On the other hand, Ohta and Yang recently showed that the defocusing AL system, which is modulationally stable for , becomes unstable if , and exhibits discrete rogue wave solutions, some of which are regular for all times. Here, we construct the IST for the defocusing AL with , analyze the spectrum, and characterize the soliton and rational solutions from a spectral point of view. We formulate the direct and inverse problems by using a suitable uniformization variable, and pose the inverse problem as an RHP across a simple contour in the complex plane of the uniform variable. As a by‐product of the IST, we also obtain explicit soliton solutions, which are the discrete analog of the celebrated Kuznetsov–Ma, Akhmediev, Peregrine solutions, and which mimic the corresponding solutions for the focusing AL equation. Soliton solutions that are the analog of the dark soliton solutions of the defocusing AL equation in the case are also presented.     

A difference equation approach to Plancherel-Rotach asymptotics for -orthogonal polynomials

In this paper, we employ a difference equation approach to study the Plancherel-Rotach asymptotics of -orthogonal polynomials about their largest zeros. Our method for -difference equations is an analogue to the turning point problem for Hermite differential equations. It works well in the toy problems of Stieltjes-Wigert polynomials and -Hermite polynomials.     

Connection formulae for asymptotics of the fifth Painlevé transcendent on the imaginary axis: I

Leading terms of asymptotic expansions for the general complex solutions of the fifth Painlevé equation as are found. These asymptotics are parameterized by monodromy data of the associated linear ODE, The parameterization allows one to derive connection formulae for the asymptotics. We provide numerical verification of the results. Important special cases of the connection formulae are also considered.     

Commutativity of quaternion‐matrix–valued functions and quaternion matrix dynamic equations on time scales

In this paper, we obtain some basic results of quaternion algorithms and quaternion calculus on time scales. Based on this, a Liouville formula and some related properties are derived for quaternion dynamic equations on time scales through conjugate transposed matrix algorithms. Moreover, we introduce the quaternion matrix exponential function by homogeneous quaternion matrix dynamic equations. Also a corresponding existence and uniqueness theorem is proved. In addition, the commutativity of quaternion‐matrix–valued functions is investigated and some sufficient and necessary conditions of commutativity and noncommutativity are established on time scales. Also the fundamental solution matrices of some basic quaternion matrix dynamic equations are obtained. Examples are provided to illustrate the results, which are completely new on hybrid domains particularly when the time scales are the quantum case and the discrete case ; , both of which are significant for the study of quaternion q‐dynamic equations and quaternion difference dynamic equations. Finally, we present several applications including multidimensional rotations and transformations of the submarine, the gyroscope, and the planet whose dynamical behaviors are depicted by quaternion dynamics on time scales and the corresponding iteration numerical solution for homogeneous quaternion dynamic equations are provided on various time scales.     

Well‐posedness,positivity, and time asymptotics properties for a reaction–diffusion model of plankton communities,involving a rational nonlinearity with singularity

In this work, we consider a reaction–diffusion system, modeling the interaction between nutrients, phytoplankton, and zooplankton. Using a semigroup approach in , we prove global existence, uniqueness, and positivity of the solutions. The nonlinearity is handled by providing estimates in , allowing to deal with most of the functional responses that describe predator/prey interactions (Holling I, II, III, Ivlev) in ecology. The paper finally exhibits some time asymptotic properties of the solutions.     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

Dimension of the space generated by Steiner systems

To every Steiner system with parameters on and blocks , we can assign its characteristic vector , which is a ‐vector whose entries are indexed by the ‐subsets of such that for each ‐subset of if and only if . In this paper, we show that the dimension of the vector space generated by all of the characteristic vectors of Steiner systems with parameters is , provided that and there is at least one such system.     

Non‐autonomous forms and invariance

We generalize the Beurling–Deny–Ouhabaz criterion for parabolic evolution equations governed by forms to the non‐autonomous, non‐homogeneous and semilinear case. Let be Hilbert spaces such that V is continuously and densely embedded in H and let be the operator associated with a bounded H‐elliptic form for all . Suppose is closed and convex and the orthogonal projection onto . Given and , we investigate when the solution of the non‐autonomous evolutionary problem remains in and show that this is the case if for a.e. . Moreover, we examine necessity of this condition and apply this result to a semilinear problem.     

On the honeymoon Oberwolfach problem

The honeymoon Oberwolfach problem HOP asks the following question. Given newlywed couples at a conference and round tables of sizes , is it possible to arrange the participants at these tables for meals so that each participant sits next to their spouse at every meal and sits next to every other participant exactly once? A solution to HOP is a decomposition of , the complete graph with additional copies of a fixed 1‐factor , into 2‐factors, each consisting of disjoint ‐alternating cycles of lengths . It is also equivalent to a semi‐uniform 1‐factorization of of type ; that is, a 1‐factorization such that for all , the 2‐factor consists of disjoint cycles of lengths . In this paper, we first introduce the honeymoon Oberwolfach problem and then present several results. Most notably, we completely solve the case with uniform cycle lengths, that is, HOP. In addition, we show that HOP has a solution in each of the following cases: ; is odd and ; as well as for all . We also show that HOP has a solution whenever is odd and the Oberwolfach problem with tables of sizes has a solution.     

A complete solution to existence of H designs

An H design is a triple , where is a set of points, a partition of into disjoint sets of size , and a set of ‐element transverses of , such that each ‐element transverse of is contained in exactly one of them. In 1990, Mills determined the existence of an H design with . In this paper, an efficient construction shows that an H exists for any integer with . Consequently, the necessary and sufficient conditions for the existence of an H design are , , and , with a definite exception .     

A method to construct 1‐rotational factorizations of complete graphs and solutions to the oberwolfach problem

The concept of a 1‐rotational factorization of a complete graph under a finite group was studied in detail by Buratti and Rinaldi. They found that if admits a 1‐rotational 2‐factorization, then the involutions of are pairwise conjugate. We extend their result by showing that if a finite group admits a 1‐rotational ‐factorization with even and odd, then has at most conjugacy classes containing involutions. Also, we show that if has exactly conjugacy classes containing involutions, then the product of a central involution with an involution in one conjugacy class yields an involution in a different conjugacy class. We then demonstrate a method of constructing a 1‐rotational ‐factorization under given a 1‐rotational 2‐factorization under a finite group . This construction, given a 1‐rotational solution to the Oberwolfach problem , allows us to find a solution to when the ’s are even (), and when is an odd prime, with no restrictions on the ’s.     

On the limit Sobolev regularity for Dirichlet and Neumann problems on Lipschitz domains

We construct a bounded C¹ domain Ω in for which the regularity for the Dirichlet and Neumann problems for the Laplacian cannot be improved, that is, there exists f in such that the solution of in Ω and either on or on is contained in but not in for any . An analogous result holds for Sobolev spaces with .     

On polynomial approximations to AC

Classical approximation results show that any circuit of size and depth has an ‐error probabilistic polynomial over the reals of degree . We improve this upper bound to , which is much better for small values of . We then use this result to show that ‐wise independence fools circuits of size and depth up to error at most , improving on Tal's strengthening of Braverman's result that ‐wise independence suffices. To our knowledge, this is the first PRG construction for that achieves optimal dependence on the error . We also prove lower bounds on the best polynomial approximations to . We show that any polynomial approximating the function on bits to a small constant error must have degree at least . This result improves exponentially on a result of Meka, Nguyen, and Vu (Theory Comput. 2016).     

Filling the complexity gaps for colouring planar and bounded degree graphs

A colouring of a graph is a function such that for every . A -regular list assignment of is a function with domain such that for every , is a subset of of size . A colouring of respects a -regular list assignment of if for every . A graph is -choosable if for every -regular list assignment of , there exists a colouring of that respects . We may also ask if for a given -regular list assignment of a given graph , there exists a colouring of that respects . This yields the -Regular List Colouring problem. For , we determine a family of classes of planar graphs, such that either -Regular List Colouring is -complete for instances with , or every is -choosable. By using known examples of non--choosable and non--choosable graphs, this enables us to classify the complexity of -Regular List Colouring restricted to planar graphs, planar bipartite graphs, planar triangle-free graphs, and planar graphs with no -cycles and no -cycles. We also classify the complexity of -Regular List Colouring and a number of related colouring problems for graphs with bounded maximum degree.