RESEARCH ANNOUNCEMENTS On the Uniqueness of Limit Cycle for a Generalized Liénard System

ＲＥＳＥＡＲＣＨＡＮＮＯＵＮＣＥＭＥＮＴＳＯｎｔｈｅＵｎｉｑｕｅｎｅｓｏｆＬｉｍｉｔＣｙｃｌｅｆｏｒａＧｅｎｅｒａｌｉｚｅｄＬｉéｎａｒｄＳｙｓｔｅｍＨｅＱｉｍｉｎ（何启敏）（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＳｕｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，Ｓｕｚｈｏｕ，...     

MATHER SETS FOR SUBLINEAR DUFFING EQUATIONS

ＭＡＴＨＥＲＳＥＴＳＦＯＲＳＵＢＬＩＮＥＡＲＤＵＦＦＩＮＧＥＱＵＡＴＩＯＮＳ￥ＱＩＡＮＤＩＮＧＢＩＡＮ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｕｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，２１５００６，Ｃｈｉｎａ．）Ａｂｓｔｒａｃｔ：Ｔｈｅｅｘｉｓｔｅ...     

On Bahadur asymptotic efficiency in a semiparametric regression model

ＯＮＢＡＨＡＤＵＲＡＳＹＭＰＴＯＴＩＣＥＦＦＩＣＩＥＮＣＹＩＮＡＳＥＭＩＰＡＲＡＭＥＴＲＩＣＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬＬＩＡＮＧＨＵＡ（梁华）;ＣＨＥＮＧＰＩＮＧ（成平）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ,ｔｈｅＣｈｉｎｅｓｅＡ...     

k-NN METHOD IN PARTIAL LINEAR MODEL UNDER RANDOM CENSORSHIP

ｋ－ＮＮＭＥＴＨＯＤＩＮＰＡＲＴＩＡＬＬＩＮＥＡＲＭＯＤＥＬＵＮＤＥＲＲＡＮＤＯＭＣＥＮＳＯＲＳＨＩＰＱＩＮＧＥＮＧＳＨＥＮＧ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｉｃｈｕａｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈｅｎｇｄｕ６１００６４）．Ａｂｓｔ...     

ADMISSIBILITY OF LINEAR ESTIMATE OF REGRESSION COEFFICIENTS IN GROWTH CURVE MODEL UNDER MATRIX LOSS

ＡＤＭＩＳＳＩＢＩＬＩＴＹＯＦＬＩＮＥＡＲＥＳＴＩＭＡＴＥＯＦＲＥＧＲＥＳＳＩＯＮＣＯＥＦＦＩＣＩＥＮＴＳＩＮＧＲＯＷＴＨＣＵＲＶＥＭＯＤＥＬＵＮＤＥＲＭＡＴＲＩＸＬＯＳＳＷＡＮＧＸＵＥＲＥＮ（王学仁）（ＤｅｐａｒｔｍｅｎｔｏｆＳｔａｔｉｓｔｉｃｓ，...     

ON STEFAN PROBLEM WITH PRESCRIBED CONVECTION

ＯＮＳＴＥＦＡＮＰＲＯＢＬＥＭＷＩＴＨＰＲＥＳＣＲＩＢＥＤＣＯＮＶＥＣＴＩＯＮＦａｈｕａｋＹｉ（易法槐）（ＳｕｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｓｕｚｈｏｕ，Ｊｉａｎｇｓｕ，２１５００６Ｃｈｉｎａ）Ｙｉｐｉ...     

A modified Frank-Wolfe algorithm and its convergence properties

ＡＭＯＤＩＦＩＥＤＦＲＡＮＫ－ＷＯＬＦＥＡＬＧＯＲＩＴＨＭＡＮＤＩＴＳＣＯＮＶＥＲＧＥＮＣＥＰＲＯＰＥＲＴＩＥＳＷＵＦＡＮＧ（吴方）ＷＵＳＨＩＱＵＡＮ（吴士泉）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ,ｔｈｅＣｈｉｎｅｓｅＡｃａｄ...     

SMALL PERTURBATION CRAMER METHODS AND MODERATE DEVIATIONS FOR MARKOV PROCESSES

ＳＭＡＬＬＰＥＲＴＵＲＢＡＴＩＯＮＣＲＡＭＥＲＭＥＴＨＯＤＳＡＮＤＭＯＤＥＲＡＴＥＤＥＶＩＡＴＩＯＮＳＦＯＲＭＡＲＫＯＶＰＲＯＣＥＳＳＥＳＧａｏＦｕｑｉｎｇ（高付清）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｍａｔｉｃｓ，ＨｕｂｅｉＵａｉｖｅｒｓｉｔｙ，Ｗｕ...     

A SUCCESSIVE APPROXIMATION METHOD FOR SOLVING PROBABILISTIC CONSTRAINED PROGRAMS

ＡＳＵＣＣＥＳＳＩＶＥＡＰＰＲＯＸＩＭＡＴＩＯＮＭＥＴＨＯＤＦＯＲＳＯＬＶＩＮＧＰＲＯＢＡＢＩＬＩＳＴＩＣＣＯＮＳＴＲＡＩＮＥＤＰＲＯＧＲＡＭＳＷＡＮＧＪＩＮＤＥ（王金德）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓ...     

BOUNDARY LAYER ESTIMATION OF A SINGULAR PROBLEM WITH LIMIT EQUATION OF ORDER 2

ＢＯＵＮＤＡＲＹＬＡＹＥＲＥＳＴＩＭＡＴＩＯＮＯＦＡＳＩＮＧＵＬＡＲＰＲＯＢＬＥＭＷＩＴＨＬＩＭＩＴＥＱＵＡＴＩＯＮＯＦＯＲＤＥＲ２ＨＥＣＨＥＮＧ（何成）ＺＨＡＮＧＷＥＩＴＡＯ（张维弢）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，Ｃｈｉｎｅ...     

On a conjecture of Brouwer involving the connectivity of strongly regular graphs

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components.We show that strongly regular graphs constructed from copolar spaces and from the more general spaces called Δ-spaces are counterexamples to Brouwer?s Conjecture. Using J.I. Hall?s characterization of finite reduced copolar spaces, we find that the triangular graphs T(m), the symplectic graphs Sp(2r,q) over the field Fq (for any q prime power), and the strongly regular graphs constructed from the hyperbolic quadrics O⁺(2r,2) and from the elliptic quadrics O⁻(2r,2) over the field F₂, respectively, are counterexamples to Brouwer?s Conjecture. For each of these graphs, we determine precisely the minimum number of vertices whose removal disconnects the graph into non-singleton components. While we are not aware of an analogue of Hall?s characterization theorem for Δ-spaces, we show that complements of the point graphs of certain finite generalized quadrangles are point graphs of Δ-spaces and thus, yield other counterexamples to Brouwer?s Conjecture.We prove that Brouwer?s Conjecture is true for many families of strongly regular graphs including the conference graphs, the generalized quadrangles GQ(q,q) graphs, the lattice graphs, the Latin square graphs, the strongly regular graphs with smallest eigenvalue −2 (except the triangular graphs) and the primitive strongly regular graphs with at most 30 vertices except for few cases.We leave as an open problem determining the best general lower bound for the minimum size of a disconnecting set of vertices of a strongly regular graph, whose removal disconnects the graph into non-singleton components.     

On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph

In this paper we study a conjecture of Martin [7] on the paramaters of completely regular codes in distance-regular graphs. We show that this conjecture is not true in general, but for most classical graphs it is true. we also show that there is a counterexample in the Biggs-Smith graph for a weakened version of Martin's conjecture. Furthermore we classify the completely regular codes in the Biggs-Smith graph.     

Graph homomorphisms and nodal domains

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs.     

Ekeland's variational principle in locally convex spaces and the density of extremal points

In this paper, we prove a general version of Ekeland's variational principle in locally convex spaces, where perturbations contain subadditive functions of topology generating seminorms and nonincreasing functions of the objective function. From this, we obtain a number of special versions of Ekeland's principle, which include all the known extensions of the principle in locally convex spaces. Moreover, we give a general criterion for judging the density of extremal points in the general Ekeland's principle, which extends and improves the related known results.     

K-Factors and Hamilton Cycles in Graphs

We discuss k-factors and Hamiltonian Graphs in graph theory. We prove a general version of the conjecture by R. Haggkvist; as a result, we prove two extended versions of two well-known theorems due to O. Ore and B. Jachson, respectively.     

A closed graph theorem for order bounded operators

The closed graph theorem is one of the cornerstones of linear functional analysis in Fréchet spaces, and the extension of this result to more general topological vector spaces is a di?cult problem comprising a great deal of technical difficulty. However, the theory of convergence vector spaces provides a natural framework for closed graph theorems. In this paper we use techniques from convergence vector space theory to prove a version of the closed graph theorem for order bounded operators on Archimedean vector lattices. This illustrates the usefulness of convergence spaces in dealing with problems in vector lattice theory, problems that may fail to be amenable to the usual Hausdorff-Kuratowski-Bourbaki concept of topology.     

Planar and affine spaces

In this note, we characterize finite three-dimensional affine spaces as the only linear spaces endowed with set Ω of proper subspaces having the properties (1) every line contains a constant number of points, say n, with n>2; (2) every triple of noncollinear points is contained in a unique member of Ω; (3) disjoint or coincide is an equivalence relation in Ω with the additional property that every equivalence class covers all points. We also take a look at the case n=2 (in which case we have a complete graph endowed with a set Ω of proper complete subgraphs) and classify these objects: besides the affine 3-space of order 2, two small additional examples turn up. Furthermore, we generalize our result in the case of dimension greater than three to obtain a characterization of all finite affine spaces of dimension at least 3 with lines of size at least 3.     

Subgraphs of Random Match-Graphs

 A simple graph (match-graph) generated by two-cycles of a general model of a random digraph is considered. Based on relations between a special case of such a graph and a classical model of a random graph, some results about the existence and the number of subgraphs of a given type in a random match-graph are presented. Received: December 8, 1997 Final version received: September 16, 1999     

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case

 A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. A graph is perfectly orderable if it admits an ordering such that the greedy sequential method applied on this ordering produces an optimal coloring for every induced subgraph. Chvátal conjectured that every bull-free graph with no odd hole or antihole is perfectly orderable. In a previous paper we studied the structure of general bull-free perfect graphs, and reduced Chvátal's conjecture to the case of weakly chordal graphs. Here we focus on weakly chordal graphs, and we reduce Chvátal's conjecture to a restricted case. Our method lays out the structure of all bull-free weakly chordal graphs. These results have been used recently by Hayward to establish Chvátal's conjecture for this restricted case and therefore in full. Received: November 26, 1997?Final version received: February 27, 2001     

On Group Connectivity of Graphs

Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero Z ₃-flow and Jaeger et al. [Group connectivity of graphs–a nonhomogeneous analogue of nowhere-zero flow properties, J. Combin. Theory Ser. B 56 (1992) 165-182] further conjectured that every 5-edge-connected graph is Z ₃-connected. These two conjectures are in general open and few results are known so far. A weaker version of Tutte’s conjecture states that every 4-edge-connected graph with each edge contained in a circuit of length at most 3 admits a nowhere-zero Z ₃-flow. Devos proposed a stronger version problem by asking if every such graph is Z ₃-connected. In this paper, we first answer this later question in negative and get an infinite family of such graphs which are not Z ₃-connected. Moreover, motivated by these graphs, we prove that every 6-edge-connected graph whose edge set is an edge disjoint union of circuits of length at most 3 is Z ₃-connected. It is a partial result to Jaeger’s Z ₃-connectivity conjecture. Received: May 23, 2006. Final version received: January 13, 2008