一平面可积三次非Hamilton系统的Abel积分

本文讨论一平面可积三次非Hamilton系统在n次多项式扰动下Abel积分零点个数上确界，得到的结论是该Abel积分的零点个数的上确界为n。     

On the multiple exterior degree of finite groups

Recently the first two authors have introduced a group invariant, called exterior degree, which is related to the number of elements x and y of a finite group G such that xΛy = 1 in the exterior square GΛG of G. Research on this topic gives some relations between this concept, the Schur multiplier and the capability of a finite group. In the present paper, we will generalize the concept of exterior degree of groups and we will introduce the multiple exterior degree of finite groups. Among other results, we will obtain some relations between the multiple exterior degree, multiple commutativity degree and capability of finite groups.     

On the number of limit cycles of polynomial Liénard systems

Liénard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Liénard systems of arbitrary degree on the plane, and develop a new method to obtain a lower bound of the maximal number of limit cycles. Using the method and basing on some known results for lower degree we obtain new estimations of the number of limit cycles in the systems which greatly improve existing results.     

一平面Hamilton系统的Abel积分的零点个数估计

本文讨论一平面Hamilton系统在一般n次多项式扰动下的系统的Abel积分的零点个数估计问题,得到的结论是:该系统的Abel积分的零点个数的上界为[(3n-1)/2]。     

On lower bounds for the chromatic number in terms of vertex degree

In this paper we discuss the existence of lower bounds for the chromatic number of graphs in terms of the average degree or the coloring number of graphs. We obtain a lower bound for the chromatic number of K_1,t-free graphs in terms of the maximum degree and show that the bound is tight. For any tree T, we obtain a lower bound for the chromatic number of any K_2,t-free and T-free graph in terms of its average degree. This answers affirmatively a modified version of Problem 4.3 in [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995]. More generally, we discuss δ-bounded families of graphs and then we obtain a necessary and sufficient condition for a family of graphs to be a δ-bounded family in terms of its induced bipartite Turán number. Our last bound is in terms of forbidden induced even cycles in graphs; it extends a result in [S.E. Markossian, G.S. Gasparian, B.A. Reed, β-perfect graphs, J. Combin. Theory Ser. B 67 (1996) 1–11].     

On matching numbers of tree and bipartite degree sequences

We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible values. For bipartite degree sequences, we show the existence of realizations with a restricted structure, which allows to derive an analogue of the Gale–Ryser Theorem characterizing bipartite degree sequences. More precisely, we show that a bipartite degree sequence has a realization with a certain matching number if and only if a cubic number of inequalities similar to those in the Gale–Ryser Theorem are satisfied. For tree degree sequences as well as for bipartite degree sequences, the possible values of the matching number form intervals.     

Degeneracy in the length spectrum for metric graphs

In this note we show that the length spectrum for metric graphs exhibits a very high degree of degeneracy. More precisely, we obtain an asymptotic for the number of pairs of closed geodesics (or closed cycles) with the same metric length.     

Longitudinal normals and the existence of acoustic axes in crystals

We obtain three conditions on the phase speeds of the longitudinal and transverse waves propagating along the longitudinal normals in a crystal so that each of these conditions guarantees existence of acoustic axes in this crystal. The result is based on the properties of the rational-valued topological degree and of the index of a singular point for some classes of discontinuous mappings. In addition, we give an upper estimate of the number of acoustic axes in a crystal and show some interrelation between their indices.     

Differential geometry of tensor product immersions

In this article we obtain the best possible estimates of the type number of tensor product immersions and investigate tensor product immersions with lowest possible type. Several classification theorems in this respect are then proved.     

On the enumeration of polynomials with prescribed factorization pattern

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of monic n-smooth polynomials of degree m over a finite field, as well as the number of monic n-smooth polynomials of degree m with the prescribed trace coefficient.     

Necklaces,symmetries and self-reciprocal polynomials

The connection between a certain class of necklaces and self-reciprocal polynomials over finite fields is shown. For n?2, self-reciprocal polynomials of degree 2n arising from monic irreducible polynomials of degree n are shown to be either irreducible or the product or two irreducible factors which are necessarily reciprocal polynomials. Using DeBruijn's method we count the number of necklaces in this class and hence obtain a formula for the number of irreducible self-reciprocal polynomials showing that they exist for every even degree. Thus every extension of a finite field of even degree can be obtained by adjoining a root of an irreducible self-reciprocal polynomial.     

The Laplacian spectral radii of trees with degree sequences

In this paper, we characterize all extremal trees with the largest Laplacian spectral radius in the set of all trees with a given degree sequence. Consequently, we also obtain all extremal trees with the largest Laplacian spectral radius in the sets of all trees of order n with the largest degree, the leaves number and the matching number, respectively.     

On the edge-connectivity of graphs with two orbits of the same size

It is well known that the edge-connectivity of a simple, connected, vertex-transitive graph attains its regular degree. It is then natural to consider the relationship between the graph’s edge-connectivity and the number of orbits of its automorphism group. In this paper, we discuss the edge connectedness of graphs with two orbits of the same size, and characterize when these double-orbit graphs are maximally edge connected and super-edge-connected. We also obtain a sufficient condition for some double-orbit graphs to be λ^′-optimal. Furthermore, by applying our results we obtain some results on vertex/edge-transitive bipartite graphs, mixed Cayley graphs and half vertex-transitive graphs.     

Periodic motions of a class of forced infinite lattices with nearest neighbor interaction

In this paper, by using a priori bounds, topological degree and limiting arguments, we study the existence of periodic solutions of a class of one-dimensional chain of particles periodically perturbed and with nearest neighbor interaction between particles. We study the necessary and sufficient conditions for the existence of periodic solutions in two cases when the number of particles is finite and infinite and obtain different results.     

Maximizing the number of independent subsets over trees with bounded degree

The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has already been investigated by many authors. In view of the applications of this graph parameter, trees of restricted degree are of particular interest. In the current article, we give a characterization of the trees with given maximum degree which maximize the number of independent subsets, and show that these trees also minimize the number of independent edge subsets. The structure of these trees is quite interesting and unexpected: it can be described by means of a novel digital system—in the case of maximum degree 3, we obtain a binary system using the digits 1 and 4. The proof mainly depends on an exchange lemma for branches of a tree. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 49–68, 2008     

Threshold functions for small subgraphs in simple graphs and multigraphs

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of patchworks to describe the possible overlappings of copies of subgraphs. Furthermore, the proofs are based on analytic combinatorics to carry out asymptotic computations. The flexibility of our approach allows us to tackle a wide range of problems. We obtain the asymptotic number and the limiting distribution of the number of subgraphs which are isomorphic to a graph from a given set of graphs. The results apply to multigraphs as well as to (multi)graphs with degree constraints. One application is to scale-free multigraphs, where the degree distribution follows a power law, for which we show how to obtain the asymptotic number of copies of a given subgraph and give as an illustration the expected number of small cycles.     

Ollivier’s Ricci curvature and the coloring of graphs

We obtain lower bounds on the clique number and chromatic number for finite simple graphs using Ollivier’s Ricci curvature. Also we study the relations between girth and curvature. From these, we obtain curvature conditions for 3-colorability of a planar graph.     

Über den arithmetischen Rang quadratfreier Potenzproduktideale

In this paper we give an algorithm to compute an upper bound for the arithmetical rank of squarefree monomial ideals, i.e. the minimal number of hypersurfaces which cut out set-theoretically the variety of such an ideal. An apriori bound N – a=b+2 is obtained, where N means the number of variables, a the lowest degree in the ideal and b the lowest degree of syzygies in the first syzygy module (Thm. 2). These results sharpen more general results of [2] for the considered class of ideals by methods different from [1], [7].     

Counting the number of distinct real roots of certain polynomials by Bezoutian and the Galois groups over the rational number field

In this article, we count the number of distinct real roots of certain polynomials in terms of Bezoutian form. As an application, we construct certain irreducible polynomials over the rational number field which have given number of real roots and by the result of Oz Ben-Shimol [On Galois groups of prime degree polynomials with complex roots, Algebra Disc. Math. 2 (2009), pp. 99–107], we obtain an algorithm to construct irreducible polynomials of prime degree p whose Galois groups are isomorphic to S _p or A _p .