Gallai’s path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $?(n+1)∕2?$. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.     

Non-singular Green’s functions for the unbounded Poisson equation in one,two and three dimensions

In this paper, we derive the non-singular Green’s functions for the unbounded Poisson equation in one, two and three dimensions using a spectral cut-off function approach to impose a minimum length scale in the homogeneous solution. The resulting non-singular Green’s functions are relevant to applications which are restricted to a minimum resolved length scale (e.g. a mesh size $h$) and thus cannot handle the singular Green’s function of the continuous Poisson equation. We furthermore derive the gradient vector of the non-singular Green’s function, as this is useful in applications where the Poisson equation represents potential functions of a vector field.     

On the Relative Gain Array (RGA) with singular and rectangular matrices

This paper identifies a significant deficiency in the literature on the application of the Relative Gain Array (RGA) formalism in the case of singular matrices. Specifically, it is shown that the conventional use of the Moore–Penrose pseudoinverse is inappropriate because it fails to preserve critical properties that can be assumed in the nonsingular case. It is then shown that such properties can be rigorously preserved using an alternative generalized matrix inverse.     

New stability theorem for periodic Nicholson’s model with mortality term

This article mainly explores a class of non-autonomous delayed Nicholson’s blowflies model with a nonlinear density-dependent mortality term. By combining Lyapunov function method with differential inequality approach, some novel assertions are gained to guarantee the existence and exponential stability of positive periodic solutions for the addressed model, which generalize and refine the corresponding results in some recent published literature.     

Freeness for 13 lines arrangements is combinatorial

We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane.     

度量空间和锥度量空间中的若干不动点定理

给出了度量空间和锥度量空间中的若干不动点定理.利用这些不动点定理,统一并推广了度量空间和锥度量空间中的若干经典的不动点定理.     

EXISTENCE OF SOLUTIONS TO A THIRD-ORDER THREE-POINT BOUNDARY VALUE PROBLEM

In this paper,we study the existence of solutions to a third-order three-point boundary value problem.By imposing certain restrictions on the nonlinear term,we prove the existence of at least one solution to the boundary value problem by the method of lower and upper solutions.We are interested in the construction of lower and upper solutions.     

新的变系数可积耦合非线性Schr(o)dinger方程及其孤子解

基于延拓结构和Hirota双线性方法研究了广义的变系数耦合非线性Schrdinger方程.首先导出了3组新的变系数可积耦合非线性Schrdinger方程及其线性谱问题(Lax对),然后利用Hirota双线性方法给出了它们的单、双向量孤子解.这些向量孤子解在光孤子通讯中有重要的应用.     

非负NOD随机变量序列的逆矩

仅在一阶矩有限的条件下获得了非负NOD随机变量序列正则和的逆矩的渐近逼近,特别得到了部分和的逆矩的渐近逼近.本文的结论推广了已有的结果.     

L~p INEQUALITIES AND ADMISSIBLE OPERATOR FOR POLYNOMIALS

Let p(z) be a polynomial of degree at most n. In this paper we obtain some new results about the dependence of p(Rz)-βp(rz) + α (R+1/r+1)n-|β | p(rz) s on p(z) s for every α, β∈ C with |α|≤ 1, |β | ≤ 1, R > r 1, and s > 0. Our results not only generalize some well known inequalities, but also are variety of interesting results deduced from them by a fairly uniform procedure.