The hyperelliptic limit cycles of the Liénard systems

For Liénard systems , with fm and gn real polynomials of degree m and n respectively, in [H. Zoladek, Algebraic invariant curves for the Liénard equation, Trans. Amer. Math. Soc. 350 (1998) 1681-1701] the author showed that if m?3 and m+1<n<2m there always exist Liénard systems which have a hyperelliptic limit cycle. Llibre and Zhang [J. Llibre, Xiang Zhang, On the algebraic limit cycles of Liénard systems, Nonlinearity 21 (2008) 2011-2022] proved that the Liénard systems with m=3 and n=5 have no hyperelliptic limit cycles and that there exist Liénard systems with m=4 and 5<n<8 which do have hyperelliptic limit cycles. So, it is still an open problem to characterize the Liénard systems which have an algebraic limit cycle in cases m>4 and m+1<n<2m. In this paper we will prove that there exist Liénard systems with m=5 and m+1<n<2m which have hyperelliptic limit cycles.     

LIMIT CYCLE PROBLEM OF QUADRATIC SYSTEM OF TYPE （ Ⅲ ）m=0, （ Ⅲ ）

To continue the discussion in （Ⅰ ） and （ Ⅱ ）,and finish the study of the limit cycle problem for quadratic system （ Ⅲ ）m=0 in this paper. Since there is at most one limit cycle that may be created from critical point O by Hopf bifurcation,the number of limit cycles depends on the different situations of separatrix cycle to be formed around O. If it is a homoclinic cycle passing through saddle S1 on 1 ＋ax-y = 0,which has the same stability with the limit cycle created by Hopf bifurcation,then the uniqueness of limit cycles in such cases can be proved. If it is a homoclinic cycle passing through saddle N on x= 0,which has the different stability from the limit cycle created by Hopf bifurcation,then it will be a case of two limit cycles. For the case when the separatrix cycle is a heteroclinic cycle passing through two saddles at infinity,the discussion of the paper shows that the number of limit cycles will change from one to two depending on the different values of parameters of system.     

Number and Location of Limit Cycles in a Class of Perturbed Polynomial Systems

In this paper,we investigate the number,location and stability of limit cycles in a class of perturbedpolynomial systems with (2n 1) or (2n 2)-degree by constructing detection function and using qualitativeanalysis.We show that there are at most n limit cycles in the perturbed polynomial system,which is similar tothe result of Perko in [8] by using Melnikov method.For n=2,we establish the general conditions dependingon polynomial's coefficients for the bifurcation,location and stability of limit cycles.The bifurcation parametervalue of limit cycles in [5] is also improved by us.When n=3 the sufficient and necessary conditions for theappearance of 3 limit cycles are given.Two numerical examples for the location and stability of limit cycles areused to demonstrate our theoretical results.     

Bifurcation set and distribution of limit cycles for a class of cubic Hamiltonian system with higher-order perturbed terms

A class of cubic Hamiltonion system with the higher-order perturbed term of degree n=5, 7, 9, 11, 13 is investigated. We find that there exist at least 13 limit cycles with the distribution C¹₉⊃2[C²₃⊃2C²₂] (let C_m^k denote a nest of limit cycles which encloses m singular points, and the symbol `⊂' is used to show the enclosing relations between limit cycles, while the sign `+' is used to divide limit cycles enclosing different critical points. Denote simply C_m^k+C_m^k=2C_m^k, etc.) in the Hamiltonian system under the perturbed term of degree 7, and give the complete bifurcation diagrams and classification of the phase portraits by using bifurcation theory and qualitative method and numerical simulations. These results in this paper are useful for the study of the weaken Hilbert 16th problem.     

Lower bounds for the cardinality of minimal blocking sets in projective spaces

In this paper new lower bounds for the cardinality of minimal m-blocking sets are determined. Let r₂(q) be the number such that q+r₂(q)+1 is the cardinality of the smallest non-trivial line-blocking set in a plane of order q. If B is a minimal m-blocking set in PG(n,q) that contains at most q^m+q^m−1+…+q+1+r₂(q)·(∑_i=2m−n′^m−1qⁱ) points for an integer n′ satisfying mn′2m, then the dimension of B is at most n′. If the dimension of B is n′, then the following holds. The cardinality of B equals q^m+q^m−1+…+q+1+r₂(q)(∑_i=2m−n′^m−1qⁱ). For n′=m the set B is an m-dimensional subspace and for n′=m+1 the set B is a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. This result is due to Heim (Mitt. Math. Semin. Giessen 226 (1996), 4–82). For n′>m+1 and q not a prime the number q is a square and for q16 the set B is a Baer cone. If q is odd and |B|<q^m+q^m−1+…+q+1+r₂(q)(q^m−1+q^m−2), it follows from this result that the subspace generated by B has dimension at most m+1. Furthermore we prove that in this case, if , then B is an m-dimensional subspace or a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. For q=p^3h, p7 and q not a square we show this assertion for |B|q^m+q^m−1+…+q+1+q^2/3·(q^m−1+…+1).     

On the Maximum Number of Cycles in Outerplanar and Series–Parallel Graphs

Let c(n) be the maximum number of cycles in an outerplanar graph with n vertices. We show that lim c(n)^1/n exists and equals β = 1.502837 . . ., where β is a constant related to the recurrence x_n+1 = 1 + x_n²,  x₀=1{x_{n+1} = 1 + x_n^2, \, x_0=1}. The same result holds for the larger class of series–parallel graphs.     

Ideal class groups and their subgroups of real quadratic fields

A necessary and sufficient condition is given for the ideal class group H(m) of a real quadratic field Q (√m) to contain a cyclic subgroup of ordern. Some criteria satisfying the condition are also obtained. And eight types of such fields are proved to have this property, e.g. fields withm=(z ⁿ +t−1)²+4t(witht|z ⁿ −1), which contains the well-known fields withm=4z ⁿ +1 andm=4z ²ⁿ +4 as special cases. Project supported by the National Natural Science Foundation of China.     

Condorcet proportions and Kelly's conjectures

Let C(m,n) be the proportion of all n-tuples of linear orders on a set of m alternatives such that some alternative x is ranked ahead of y in at least n of the orders, for each y≠x. Kelly proved that C(m,n)<C(m,r+1) for m3 and odd n 3, and that C(m,n)>C(m,n+1) for m3 and even n2. He also conjectured that C(m,n)>C(m+1,n) for m3 and n=3 or n5, and that C(m,n)>C(m,n+2) for m3 and n=1 or n3. The first of these conjectures is shown to be true for n=3. and for m=3 and odd n. The second conjecture is established for mε{3,4} and odd n, and for m=3 and all large even n.     

Irreducible 2‐fold cycle systems

In this paper, it is shown that for any pair of integers (m,n) with 4 ≤ m ≤ n, if there exists an m‐cycle system of order n, then there exists an irreducible 2‐fold m‐cycle system of order n, except when (m,n) = (5,5). A similar result has already been established for the case of 3‐cycles. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 324–332, 2006     

Ramsey functions involving with large

For fixed integers m,k2, it is shown that the k-color Ramsey number r_k(K_m,n) and the bipartite Ramsey number b_k(m,n) are both asymptotically equal to k^mn as n→∞, and that for any graph H on m vertices, the two-color Ramsey number is at most (1+o(1))n^m+1/(logn)^m-1. Moreover, the order of magnitude of is proved to be n^m+1/(logn)^m if H≠K_m as n→∞.     

Asymptotic Determination of the Last Packing Number of Quadruples

A 3-(n,4,1) packing design consists of an n-element set X and a collection of 4-element subsets of X, called blocks, such that every 3-element subset of X is contained in at most one block. The packing number of quadruples d(3,4,n) denotes the number of blocks in a maximum 3-(n,4,1) packing design, which is also the maximum number A(n,4,4) of codewords in a code of length n, constant weight 4, and minimum Hamming distance 4. In this paper the last packing number A(n,4,4) for n≡ 5(mod 6) is shown to be equal to Johnson bound with 21 undecided values n=6k+5, k∈{m: m is odd , 3≤ m≤ 35, m≠ 17,21}∪ {45,47,75,77,79,159}. AMS Classification:05B40, 94B25     

Enumeration of Planar Constellations

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n ≥ 1, and let σ₀ be a permutation of _n having d_i cycles of length i, for i ≥ 1. Let m ≥ 2. We prove that the number of m-tuples (σ₁,…,σ_m) of permutation of _n such that

• σσ···σ = σ,

• the group generated by σ,…,σ acts transitively on {1, 2,…,},

• ∑ (σ) = ( − 1) + 2, where (σ) denotes the number of cycles of σ

A one-to-one correspondence relates these m-tuples to some rooted planar maps, which we call constellations and enumerate via a bijection with some bicolored trees. For m = 2, we recover a formula of Tutte for the number of Eulerian maps. The proof relies on the idea that maps are conjugacy classes of trees and extends the method previously applied to Eulerian maps by the second author. Our result might remind the reader of an old theorem of Hurwitz, giving the number of m-tuples of transpositions satisfying the above conditions. Indeed, we show that our result implies Hurwitz' theorem. We also briefly discuss its implications for the enumeration of nonequivalent coverings of the sphere.     

Graphs with unavoidable subgraphs with large degrees

Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a K_{k + 1} in terms of the number of edges in G. In this paper we prove that, for m = αn², α > (k - 1)/2k, G contains a K_{k + 1}, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n²/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn², α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n).     

The evaluation of Tornheim double sums. Part 2

We provide an explicit formula for the Tornheim double series T(a,0,c) in terms of an integral involving the Hurwitz zeta function. For integer values of the parameters, a=m, c=n, we show that in the most interesting case of even weight N:=m+n the Tornheim sum T(m,0,n) can be expressed in terms of zeta values and the family of integrals

On the Crossing Number of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> □ <Emphasis Type="Italic">P</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(K_m □ P_n), the crossing number of the Cartesian product K_m □ P_n. We prove that for m ≥ 3,n ≥ 1 and cr(K_m □ P_n)≥ (n − 1)cr(K_m+2 − e) + 2cr(K_m+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K₆ □ P_n) = 15n + 3. Research supported by NFSC (60373096, 60573022).     

Algorithms for shortest paths and d-cycle problems

Let G be a weighted graph with n vertices and m edges. We address the d-cycle problem, i.e., the problem of finding a subgraph of minimum weight with given cyclomatic number d. Hartvigsen [Minimum path bases, J. Algorithms 15 (1993) 125–142] presented an algorithm with running time O(n²m) and O(n^2d−1m²) for the cyclomatic numbers d=1 and d2, respectively. Using a (d+1)-shortest-paths algorithm, we develop a new more efficient algorithm for the d-cycle problem with running time O(n^2d−1+n²m+n³logn).     

A semi-recursion for the number of involutions in special orthogonal groups over finite fields

Let I(n) be the number of involutions in a special orthogonal group SO(n,Fq) defined over a finite field with q elements, where q is the power of an odd prime. Then the numbers I(n) form a semi-recursion, in that for m>1 we haveI(2m+3)=(q2m+2+1)I(2m+1)+q2m(q2m−1)I(2m−2). We give a purely combinatorial proof of this result, and we apply it to give a universal bound for the character degree sum for finite classical groups defined over Fq.     

On a Question of Glasby,Praeger, and Xia

A Jordan partition λ(m, n, p) = (λ₁, λ₂, … , λ _m ) is a partition of mn associated with the expression of a tensor V _m  ? V _n of indecomposable KG-modules into a sum of indecomposables, where K is a field of characteristic p and G a cyclic group of p-power order. It is standard if λ _i  = m + n ? 2i + 1 for all i. We answer a recent question of Glasby, Praeger, and Xia who asked for necessary and sufficient conditions for λ(m, n, p) to be standard.     

Perfect difference families,perfect difference matrices,and related combinatorial structures

The existence problems of perfect difference families with block size k, k=4,5, and additive sequences of permutations of length n, n=3,4, are two outstanding open problems in combinatorial design theory for more than 30 years. In this article, we mainly investigate perfect difference families with block size k=4 and additive sequences of permutations of length n=3. The necessary condition for the existence of a perfect difference family with block size 4 and order v, or briefly (v, 4,1)‐PDF, is v≡1(mod12), and that of an additive sequence of permutations of length 3 and order m, or briefly ASP (3, m), is m≡1(mod2). So far, (12t+1,4,1)‐PDFs with t<50 are known only for t=1,4−36,41,46 with two definiteexceptions of t=2,3, and ASP (3, m)'s with odd 3<m<200 are known only for m=5,7,13−29,35,45,49,65,75,85,91,95,105,115,119,121,125,133,135,145,147,161,169,175,189,195 with two definite exceptions of m=9,11. In this article, we show that a (12t+1,4,1)‐PDF exists for any t⩽1,000 except for t=2,3, and an ASP (3, m) exists for any odd 3<m<200 except for m=9,11 and possibly for m=59. The main idea of this article is to use perfect difference families and additive sequences of permutations with “holes”. We first introduce the concepts of an incomplete perfect difference matrix with a regular hole and a perfect difference packing with a regular difference leave, respectively. We show that an additive sequence of permutations is in fact equivalent to a perfect difference matrix, then describe an important recursive construction for perfect difference matrices via perfect difference packings with a regular difference leave. Plenty of perfect difference packings with a desirable difference leave are constructed directly. We also provide a general recursive construction for perfect difference packings, and as its applications, we obtain extensive recursive constructions for perfect difference families, some via incomplete perfect difference matrices with a regular hole. Examples of perfect difference packings directly constructed are used as ingredients in these recursive constructions to produce vast numbers of perfect difference families with block size 4. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 415–449, 2010     

On the wiener type regularity of a boundary point for the polyharmonic operator

It is shown that the Wiener regularity of a boundary point with respect to the m-harmonic operator is a local property for the space dimensions n=2m,2m+1,2m+2 with m > 2 and n = 4,5,6,7 with m = 2. An estimate for the continuity modulus of the solution formulated in terms of the Wiener type m-capacitary integral is obtained for the same n and m.