Normalization of sunspot cycles and eigen mode analysis

The smoothed monthly sunspot numbers of the previous 22 complete sunspot cycles are normalized in time domain, and then an eigen mode analysis is carried out to draw the principle factors (or components) in the cycles. The results show that the main characteristics of the solar cycles can be described fairly well by the first 5 eigen modes. The obtained eigen modes are used to predict the declining phase of cycle 23 on the basis of the data prior to its maximum. The prediction indicates that cycle 23 will last for 127 months to December 2006, with the minimum of 6.2.     

Existence and basisness of eigen and adjoined elements of linear operators

In this paper we continue the study described earlier in No. 5, 2006, of Russian Mathematics (Izv. Vyssh. Uchebn. Zaved., Matematika). We establish conditions, providing the asymptotics mentioned in the cited paper. We prove the basis property of eigen functions and adjoined ones in linear problems for differential equations with deviating arguments.     

The eigen functions of the complex projective space

In the complexn-dimensional projective spaceCP ⁿ , let λ _p (=4p(p+n)) be the eigen value of the Laplace-Beltrami operator andH _p be the space of all eigen functions of eigen value λ _p . The reproducing kernelh _p (z, w) ofH _p is constructed explicitly in this paper, and a system of complete orthogohal functions ofH _p is constructed fromh _p (z,w)(p=1,2, …). Partially supported by NSF of China     

Paths and cycles of hypergraphs

Hypergraphs are the most general structures in discrete mathematics. Acyclic hypergraphs have been proved very useful in relational databases. New systems of axioms for paths, connectivity and cycles of hypergraphs are constructed. The systems suit the structure properties of relational databases. The concepts of pseudo cycles and essential cycles of hypergraphs are introduced. They are relative to each other. Whether a family of cycles of a hypergraph is dependent or independent is defined. An enumeration formula for the maximum number of independent essential cycles of a hypergraph is given.     

A note on the 2-power of Hamilton cycles

We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.     

Properties of Hamilton cycles of circuit graphs of matroids

Let G be a circuit graph of a connected matroid. P. Li and G. Liu [Comput. Math. Appl., 2008, 55: 654–659] proved that G has a Hamilton cycle including e and another Hamilton cycle excluding e for any edge e of G if G has at least four vertices. This paper proves that G has a Hamilton cycle including e and excluding e′ for any two edges e and e′ of G if G has at least five vertices. This result is best possible in some sense. An open problem is proposed in the end of this paper.     

Periods in missing lengths of rainbow cycles

A cycle in an edge‐colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge‐colored graph G, define Then ??(G) is a monoid with respect to the operation n°m=n+ m?2, and thus there is a least positive integer π(G), the period of ??(G), such that ??(G) contains the arithmetic progression {N+ kπ(G)|k?0} for some sufficiently large N. Given that n∈??(G), what can be said about π(G)? Alexeev showed that π(G)=1 when n?3 is odd, and conjectured that π(G) always divides 4. We prove Alexeev's conjecture: Let p(n)=1 when n is odd, p(n)=2 when n is divisible by four, and p(n)=4 otherwise. If 2<n∈??(G) then π(G) is a divisor of p(n). Moreover, ??(G) contains the arithmetic progression {N+ kp(n)|k?0} for some N=O(n²). The key observations are: If 2<n=2k∈??(G) then 3n?8∈??(G). If 16≠n=4k∈??(G) then 3n?10∈??(G). The main result cannot be improved since for every k>0 there are G, H such that 4k∈??(G), π(G)=2, and 4k+ 2∈??(H), π(H)=4. © 2009 Wiley Periodicals, Inc. J Graph Theory     

Bifurcation of limit cycles and the cusp of ordern

The author first investigates the limit cycles bifurcating from a center for general two dimensional systems, and then proves the conjecture that any unfolding of the cusp of ordern has at mostn−1 limit cycles. Supported by the Chinese National Natural Science Foundation.     

Proper cycles of indefinite quadratic forms and their right neighbors

In this paper we consider proper cycles of indefinite integral quadratic forms F = (a, b, c) with discriminant Δ. We prove that the proper cycles of F can be obtained using their consecutive right neighbors R ⁱ(F) for i ⩾ 0. We also derive explicit relations in the cycle and proper cycle of F when the length l of the cycle of F is odd, using the transformations τ(F) = (−a, b, −c) and ϰ(F) = (−c, b, −a).     

一类五次多项式系统无穷远点等时中心条件与极限环分支

研究一类五次系统无穷远点的中心、拟等时中心条件与极限环分支问题.首先通过同胚变换将系统无穷远点转化成原点,然后求出该原点的前8个奇点量,从而导出无穷远点成为中心和最高阶细焦点的条件,在此基础上给出了五次多项式系统在无穷远点分支出8个极限环的实例.同时通过一种最新算法求出无穷远点为中心时的周期常数,得到了拟等时中心的必要条件,并利用一些有效途径一一证明了条件的充分性.     

Averaging on slow and fast cycles of a three time scale system

Pontryagin–Rodygin?s Theorem for slow and fast systems describes the slow drift during the rolling up of the trajectories around the cycles of the fast dynamics. This drift is approximated by the averaging on the cycles. The calculation of this average is generally a difficult task since it requires the knowledge of the closed orbits and their periods. We present two paradigms of three time scale systems where we can overcome this limitation. It is the case of systems the fast dynamics of which have cycles with relaxation presenting or not a canard phenomenon. We can not apply Pontryagin–Rodygin?s Theorem to these systems because their fast equation is itself singularly perturbed. We also investigate the extension of the results to unbounded time intervals. The results are stated classically and proved within the framework of nonstandard analysis.     

On the number of increasing paths in labeled cycles and stars

A labeled graph is an ordered pair （G, L） consisting of a graph G and its labeling L ： V（G） → {1,2 ,n}, where n = ｜V（G）｜. An increasing nonconsecutive path in a labeled graph （G,L） is either a path （u1,u2 uk） （k ≥ 2） in G such that L（u,） ＋ 2 ≤ L（ui＋1） for all i = 1, 2, ..., k- 1 or a path of order 1. The total number of increasing nonconsecutive paths in （G, L） is denoted by d（G, L）. A labeling L is optimal if the labeling L produces the largest d（G, L）. In this paper, a method simpler than that in Zverovich （2004） to obtain the optimal labeling of path is given. The optimal labeling of other special graphs such as cycles and stars is obtained.     

Bifurcation of small limit cycles in cubic integrable systems using higher-order analysis

In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach used for studying bifurcation of limit cycles around a center but simpler. Attention is focused on planar cubic polynomial systems and particularly it is shown that the system studied by ?o?a?dek (1995) [24] can indeed have eleven limit cycles under perturbations at least up to 7th order. Moreover, the pattern of numbers of limit cycles produced near the center is discussed up to 39th-order perturbations, and no more than eleven limit cycles are found.     

Decompositions of complete graphs into triangles and Hamilton cycles

For all odd integers n ≥ 1, let G_n denote the complete graph of order n, and for all even integers n ≥ 2 let G_n denote the complete graph of order n with the edges of a 1‐factor removed. It is shown that for all non‐negative integers h and t and all positive integers n, G_n can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G_n. © 2004 Wiley Periodicals, Inc.     

The number and distributions of limit cycles for a class of cubic near-Hamiltonian systems

This paper concerns with the number of limit cycles for a cubic Hamiltonian system under cubic perturbation. The fact that there exist 9-11 limit cycles is proved. The different distributions of limit cycles are given by using methods of bifurcation theory and qualitative analysis, among which two distributions of eleven limit cycles are new.     

Hamilton paths and cycles in vertex-transitive graphs of order

It is shown that every connected vertex-transitive graph of order 6p, where p is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order 6p which is not genuinely imprimitive contains a Hamilton cycle.     

Analysis and computation of limit cycles for systems with separable nonlinearities

The variational system obtained by linearizing a dynamical system along a limit cycle is always non-invertible. This follows because the limit cycle is only a unique modulo time translation. It is shown that questions such as uniqueness, robustness, and computation of limit cycles can be addressed using a right inverse of the variational system. Small gain arguments are used in the analysis.     

On relative length of longest paths and cycles

For a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, respectively. In this paper, we prove that if G is a 3 ‐connected graph of order n such that the minimum degree sum of four independent vertices is at least n+ 6, then p(G)?c(G)?2. By considering our result and the results in [J Graph Theory 20 (1995), 213–225; Amer Math Monthly 67 (1950), 55], we propose a conjecture which is a generalization of Bondy's conjecture. Furthermore, using our result, for a graph satisfying the above conditions, we obtain a new lower bound of the circumference and establish Thomassen's conjecture. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 279–291, 2009