This paper gives a classification of first order polynomial differential operators of form $\mathscr{X} = X_1(x_1,x_2)\delta_1 + X_2(x_1,x_2)\delta_2$, $(\delta_i = \partial/\partial x_i)$. The classification is given through the order of an operator that is defined in this paper. Let $X=\mathscr{X}y$ to be the differential polynomial associated with $\mathscr{X}$, the order of $\mathscr{X}$, $\mathrm{ord}(\mathscr{X})$, is defined as the order of a differential ideal $\Lambda$ of differential polynomials that is a nontrivial expansion of the ideal $\{X\}$ and with the lowest order. In this paper, we prove that there are only four possible values for the order of a differential operator, $0$, $1$, $2$, $3$, or $\infty$. Furthermore, when the order is finite, the expansion $\Lambda$ is generated by $X$ and a differential polynomial $A$, which can be obtained through a rational solution of a partial differential equation that is given explicitly in this paper. When the order is infinite, the expansion $\Lambda$ is just the unit ideal. In additional, if, and only if, the order of $\mathscr{X}$ is $0$, $1$, or $2$, the polynomial differential equation associating with $\mathscr{X}$ has Liouvillian first integrals. Examples and connections with Godbilon-Vey sequences are also discussed.

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of length to width of a flat knotted ribbon. This minimal ratio is called the ribbonlength of the knot. It has been conjectured that the ribbonlength has an upper bound and a lower bound which are both linear in the crossing number of the knot. In the first part of the paper, we use grid diagrams to construct flat knotted ribbons and prove an explicit quadratic upper bound on the ribbonlength for all non-trivial knots. We then improve the quadratic upper bound to a linear upper bound for all non-trivial torus knots and twist knots. Our approach of using grid diagrams to study flat knotted ribbons is novel and can likely be used to obtain a linear upper bound for more general families of knots. In the second part of the paper, we obtain a sharper linear upper bound on the ribbonlength for nontrivial twist knots by constructing a flat knotted ribbon via folding the ribbon over itself multiple times to shorten the length.

In this paper, we obtain some new Lyapunov-type inequalities for a class of even-order linear differential equations, the results are new and generalize and improve some early results in this field.

No abstract uploaded!

We develop a method searching for quasi-conformal maps from point-cloud surfaces to Euclidean plane. The maps can be got by directly solving Beltrami equation with proper boundary condition or solving optimization problem of the variational formu- lation. The point integral methd (PIM) is used for discretization on point clouds. Numerical experiments suggest that the method converges as the density of points in- creases.