THE WEINSTEIN CONJECTURE ON C~1-SMOOTH HYPERSURFACE OF CONTACT TYPE

In this note a symplectic capacity of Hofer-Zehnder type that is only invariant under C1-symplectomorphisms is defined and all computation formulae for Hofer-Zehnder symplectic capacity obtained at present are proved still holding for it. As a consequence some results on Weinstein conjecture are generalized to C1-smooth hypersurface of contact type.     

ContributionsChromatic Ramsey numbers

Suppose G is a graph. The chromatic Ramsey number r_c(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let M_n = min[r_c(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that M_n = (n − 1)² + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M₆ and M₇.     

A descent principle for the Dirac-dual-Dirac method

Let G be a torsion-free discrete group with a finite-dimensional classifying space BG. We show that G has a dual-Dirac morphism if and only if a certain coarse (co-)assembly map is an isomorphism. Hence the existence of a dual-Dirac morphism for such groups is a metric, that is, coarse, invariant. We get results for groups with torsion as well.     

关于低阶K群的若干问题

本文主要介绍了低阶Ｋ群Ｋ＿０，Ｋ＿１，Ｋ＿２及与它们相关的Ｂａｓｓ－Ｑｕｉｌｌｅｎ猜测、Ｂｉｒｃｈ－Ｔａｔｅ猜测研究的最新进展．Ｋ＿０与Ｋ＿１方面主要通过对Ｂａｓｓ～Ｑｕｉｌｌｅｎ猜测研究说明Ｋ＿０，Ｋ＿１的作用，同时也给出了一些多项式环上投射模自同构群的计算公式．在Ｋ＿２群方面，我们主要介绍了域上Ｋ＿２群，代数整数环上Ｋ＿２群以及著名的Ｂｉｒｃｈ－Ｔａｔｅ猜想．并且也给出了Ｋ＿２群一些计算方面的结果．     

Witten Solution for the Gelfand–Dikii Hierarchy

We derive formulas making it possible to calculate the Taylor expansion coefficients of the string solution for the Gelfand–Dikii hierarchy. According to the Witten conjecture, these coefficients coincide with the Mumford–Morita–Miller intersection numbers (correlators) of stable cohomology classes for the moduli space of n-spin bundles on Riemann surfaces with punctures.     

Structure of multiple solutions for nonlinear differential equations

Based on the eigensystem {λj,φj}of -Δ, the multiple solutions for nonlinear problem Δu f(u) =0 in Ω, u=0 on Ω are approximated. A new search-extension method (SEM), which consists of three steps in three level subspaces, is proposed. Numerical simulations for several typical nonlinear cases, i.e. f(u) = u~3,u~2(u-p),u~2(u~2 -p),     

The homotopy limit problem for two-primary algebraic K-theory

We solve the homotopy limit problem for two-primary algebraic K-theory of fields, that is, the Quillen-Lichtenbaum conjecture at the prime 2.     

Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification

Naturally inspired evolutionary algorithms prove effectiveness when used for solving feature selection and classification problems. Artificial Bee Colony (ABC) is a relatively new swarm intelligence method. In this paper, we propose a new hybrid gene selection method, namely Genetic Bee Colony (GBC) algorithm. The proposed algorithm combines the used of a Genetic Algorithm (GA) along with Artificial Bee Colony (ABC) algorithm. The goal is to integrate the advantages of both algorithms. The proposed algorithm is applied to a microarray gene expression profile in order to select the most predictive and informative genes for cancer classification. In order to test the accuracy performance of the proposed algorithm, extensive experiments were conducted. Three binary microarray datasets are use, which include: colon, leukemia, and lung. In addition, another three multi-class microarray datasets are used, which are: SRBCT, lymphoma, and leukemia. Results of the GBC algorithm are compared with our recently proposed technique: mRMR when combined with the Artificial Bee Colony algorithm (mRMR-ABC). We also compared the combination of mRMR with GA (mRMR-GA) and Particle Swarm Optimization (mRMR-PSO) algorithms. In addition, we compared the GBC algorithm with other related algorithms that have been recently published in the literature, using all benchmark datasets. The GBC algorithm shows superior performance as it achieved the highest classification accuracy along with the lowest average number of selected genes. This proves that the GBC algorithm is a promising approach for solving the gene selection problem in both binary and multi-class cancer classification.     

Sharp oscillation and nonoscillation tests for linear difference equations

We consider difference equations with a single delay term and obtain sufficient conditions for both oscillation and nonoscillation. Moreover, our nonoscillation theorem improves the affirmative answer to Ladas’ corrected conjecture given by Tang and Yu in [Comput. Math. Appl. 38(11–12) (1999), pp. 229–237]. We also present a detailed discussion with examples to emphasize the significance and the sharpness of the new results.     

交错群A_5与二面体群D_6直积的整群环的挠单位

本文利用Luthar-Passi方法,研究了五次交错群A_5与六阶二面体群D_6直积的整群环的挠单位,得到了该群的Zassenhaus猜想成立.