具有三次曲线解的中心对称三次系统的极限环的存在性问题

本文证明了具有三次曲线解y＝αx3的中心对称三次系统可以存在极限环，从而纠正了文[1]认为具有三次曲线解的中心对称三次系统不可能存在极限环的错误结论     

以三次曲线为特殊积分的二次系统

本文研究以三次曲线为特殊积分的二次系统:的极限环,得出一类二次系统存在极限环的充要条件。     

三次分拆数模5的幂

三次分拆由Hei-Chi Chan引入,并由Byungchan Kim命名,因为它和Ramanujan的三次连分数联系在一起.Hei-Chi Chan证明了三次分拆函数具有模3的幂的Ramanujan型同余.在最近的一篇文章中,William Y.C.Chen和Bernard L.S.Lin研究了三次分拆函数模5的同余...     

三次曲线切线的两个性质

文[1][2]给出了三次函数f（x）=ax^3＋bx^2＋cx＋d（n≠0）的对称中心为（-b/3a，f（-b/3a）），受此启发笔者对三次曲线的切线进行了研究，发现了如下两个性质，供读者参考．     

二次系统存在三次曲线弓形分界线环的充要条件

可证二次系统内含焦点的三次曲线弓形分界线环必由抛物线与直线所围成。定理1 二次系统存在三次曲线弓形分界线环的充要条件是此系统可化为以下形式     

三次系统的一类三曲线分界线环

本文证明了三次系统不可能同时存在三个三曲线x^3-3xy^2-1=0分界线环,但是可以同时存在两个三曲线分界线环,给出了同时存在两个三曲线分界线环的充要条件。     

具三次曲线解的二次系统至多有一个极限环

本文研究具有三次曲线解x^3-x^2-y^2=0的二次系统,证明此类二次系统最多只有一个极限环,进而证明了具有三次的曲线解的二次系统至多有一个极限环。     

一类三次系统极限环的存在唯一性本文得到三次系统

本文得到三次系统     

三次方程一个性质的简单证明

美国著名数学家R·柯朗在讨论用圆规直尺三等分不可能性的时候,曾经给出三次方程的一个一般性定理:“具有有理系数的三次方程如果没有有理根的话,那么从有理数域F_0出发,它的根没有一个是可构成的。”(《数学是什么》,湖     

二次李超三系的分解定理

讨论了二次李超三系的唯一分解,得到了二次李超三系分解为非退化不可约阶化理想的分解定理.     

Small maximal matchings of random cubic graphs

We consider the expected size of a smallest maximal matching of cubic graphs. Firstly, we present a randomized greedy algorithm for finding a small maximal matching of cubic graphs. We analyze the average‐case performance of this heuristic on random n‐vertex cubic graphs using differential equations. In this way, we prove that the expected size of the maximal matching returned by the algorithm is asymptotically almost surely (a.a.s.) less than 0.34623n. We also give an existence proof which shows that the size of a smallest maximal matching of a random n‐vertex cubic graph is a.a.s. less than 0.3214n. It is known that the size of a smallest maximal matching of a random n‐vertex cubic graph is a.a.s. larger than 0.3158n. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 293–323, 2009     

Conditional cubic stochastic operator

We introduce the concept of conditional cubic stochastic operator in this study. We show that any conditional cubic stochastic operator has a unique fixed point and such an operator has the property of being regular.     

Tame kernels of pure cubic fields

In this paper, we study the p-rank of the tame kernels of pure cubic fields. In particular, we prove that for a fixed positive integer m, there exist infinitely many pure cubic fields whose 3-rank of the tame kernel equal to m. As an application, we determine the 3-rank of their tame kernels for some special pure cubic fields.     

Path factors in cubic graphs

Let ? be a set of connected graphs. An ?‐factor of a graph is its spanning subgraph such that each component is isomorphic to one of the members in ?. Let P_k denote the path of order k. Akiyama and Kano have conjectured that every 3‐connected cubic graph of order divisible by 3 has a {P₃}‐factor. Recently, Kaneko gave a necessary and sufficient condition for a graph to have a {P₃, P₄, P₅}‐factor. As a corollary, he proved that every cubic graph has a {P₃, P₄, P₅}‐factor. In this paper, we prove that every 2‐connected cubic graph of order at least six has a {P_k ∣ k ≥ , 6}‐factor, and hence has a {P₃, P₄}‐factor. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 188–193, 2002; DOI 10.1002/jgt.10022     

Decomposing planar cubic graphs

The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.     

On constrained Volterra cubic stochastic operators

We consider constrained Volterra cubic stochastic operators and construct several Lyapunov functions for the constrained Volterra cubic stochastic operators. We prove that such kind operators do not have periodic trajectories. Finally, we show that the set of all constrained Volterra cubic stochastic operators is a convex compact set and find the extreme points of this set.     

On fair parametric rational cubic curves

First we derive conditions that a parametric rational cubic curve segment, with a parameter, interpolating to plane Hermite data {(x _i ^(k) ,y _i ^(k) ),i = 0, 1;k = 0, 1} contains neither inflection points nor singularities on its segment. Next we numerically determine the distribution of inflection points and singularities on a segment which gives conditions that aC ² parametric rational cubic curve interpolating to dataS = {(x _i ^(k) ,y _i ^(k) ), 0 i n} is free of inflection points and singularities. When the parametric rational cubic curve reduces to the well-known parametric cubic one, we obtain a theorem on the distribution of the inflection points and singularities on the cubic curve segment which has been widely used for finding aC ¹ fair parametric cubic curve interpolating toS.     

Modular forms and special cubic fourfolds

We study the degrees of special cubic divisors on moduli space of cubic fourfolds with at worst ADE singularities. In this paper, we show that the generating series of the degrees of such divisors is a level three modular form.     

Interpolation on lattices generated by cubic pencils

Principal lattices are distributions of points in the plane obtained from a triangle by drawing equidistant parallel lines to the sides and taking the intersection points as nodes. Interpolation on principal lattices leads to particularly simple formulae. These sets were generalized by Lee and Phillips considering three-pencil lattices, generated by three linear pencils. Inspired by the addition of points on cubic curves and using duality, we introduce an addition of lines as a way of constructing lattices generated by cubic pencils. They include three-pencil lattices and then principal lattices. Interpolation on lattices generated by cubic pencils has the same good properties and simple formulae as on principal lattices. Dedicated to C.A. Micchelli for his mathematical contributions and friendship on occasion of his sixtieth birthday Mathematics subject classifications (2000) 41A05, 41A63, 65D05. J.M. Carnicer: Partially supported by the Spanish Research Grant BFM2003-03510, by Gobierno de Aragón and Fondo Social Europeo.