从立方抛物线谈起(1)--余弦型振动,椭圆余弦型振动与双曲线型非周期运动

从立方抛物线的特性谈起 ,用较初浅的方法 ,借助于雅可比椭圆函数求椭圆方程的解来说明一大类一维保守系统的余弦振动、椭圆余弦型振动与双曲线型非周期运动 .并以杜芬振子、单摆、倒摆、转动圆环上的小环运动为典型实例作了详细讨论     

一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

试探方程法及其在非线性发展方程中的应用

提出了一种比较系统的求解非线性发展方程精确解的新方法, 即试探方程法. 以一个带5阶 导数项的非线性发展方程为例, 利用试探方程法化成初等积分形式，再利用三阶多项式的完 全判别系统求解，由此求得的精确解包括有理函数型解, 孤波解, 三角函数型周期解, 多项 式型Jacobi椭圆函数周期解和分式型Jacobi椭圆函数周期解 关键词： 试探方程法 非线性发展方程 孤波解 Jacobi椭圆函数 周期解     

New Jacobian Elliptic Function Solutions of Modified KdV Equation: Ⅱ

Recently, we obtained thirteen families of Jacobian elliptic function solutions of mKdV equation by usingour extended Jacobian elliptic function expansion method. In this note, the mKdV equation is investigated and anotherthree families of new doubly periodic solutions (Jacobian elliptic function solutions) are fbund again by using a newtransformation, which and our extended Jacobian elliptic function expansion method form a new method still called theextended Jacobian elliptic function expansion method. The new method can be more powertul to be applied to othernonlinear differential equations.     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

A polynomial algorithm for one problem of guillotine cutting

We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.     

New Jacobian Elliptic Function Solutions of Modified KdV Equation: Ⅲ

More recently, sixteen families of Jacobian elliptic function solutions of mKdV equation have been foundby using our extended Jacobian elliptic function expansion method. In this paper, we continue to improve our methodby using another eight pairs of the closed Jacobian elliptic functions. The mKdV equation is chosen to illustrate theimproved method such that another eight families of new Jacobian elliptic function solutions are obtained again. Thenew method can be more powerful to be applied to other nonlinear differential equations.