Abstract : We define a dimension, called FP-projective dimension, for modules and rings. It measures how far away a finitely generated module is from being finitely presented, and how far away a ring is from being Noetherian. This dimension has nice properties when the ring in question is coherent. The relations between the FP-projective dimension and other homological dimensions are discussed.

Abstract : Some results obtained in our exploring the related algebraic structure these years are presented in this exposition. It consists of four aspects: (1) The study of radical theory of rings (modules) and generalization; (2) Descriptions and computations on homological dimensions; (3) The structure of K group with lower rank; (4) Large subdirect products and the related structure of prufer rings. Finally, two questions are posed.

Keywords: ring, module, homological dimension, K group

AMS subject classification: 16E50; 16S90

^f The author is supported in part by NNSFC(A0324660)

Abstract : Constant weight codes (CWCs) are an important class of codes in coding theory. Generalized Steiner systems GS(2,k,v,g) were first introduced by Etzion and used to construct optimal nonlinear CWCs over an alphabet of size g+1 with minimum Hamming distance 2k-3, in which each codeword has length v and weight k. In this talk, Weil's theorem on character sum estimates is used to show that there exists a GS(2,4,v,3) for any prime v º 1  (mod  4) and v > 13. From the coding theory point of view, we can get that an optimal nonlinear quaternary (v,5,4) CWC exists for such a prime v.

Abstract : The largest class of algebraic hyperstructures satisfying the group-like axiom is called the H_n-group. Here, the notion of an H_n-normal subgroup and anH_n- quotient group of an H_n-group are defined. Then the fundamental equivalence relation for H_n-quotient group and the first isomorphism theorem for H_n-groups is obtained.

Abstract : A Vogan diagram is a Dynkin diagram with an involution, and the vertices fixed by the involution may be painted. They represent real simple Lie algebras, and two diagrams are said to be equivalent if they represent the same Lie algebra. In this talk we classify the equivalence classes of all Vogan diagrams. In doing so, we find that the underlying Dynkin diagrams have certain properties in graph painting. We show that this combinatorial property provides an easy classification for most of the simply-laced Dynkin diagrams.

Abstract : A Hadamard matrix of order v is a v×v matrix H with entries ±1 such HH^t = vI where I is the identity matrix. A Hadamard matrix is called regular if each row contains the same number of entries 1. It is conjectured that a Hadamard matrix of order v > 2 exists if and only if v is divisible by 4.

While the construction of Hadamard matrices of order 4t for arbitrary t seems out of reach at the present time, there may be some hope to construct Hadamard matrices of order 4q² for all prime powers q. For q º 1\mod 4 and q º 3\mod 8 this already has been accomplished by the marvelous work of Mingyuan Xia and Gang Liu. The constructions of Xia and Liu are based on cyclotomy, namely, the use of 4th, 8th and (q+1)th cyclotomic classes in \Bbb F_q². However, it seems that the difficulty of implementing the approach using cyclotomy increases with the exact power of 2 dividing q+1, In fact, up to our knowledge no general constructions for Hadamard matrices of order 4q² with q º 7\mod 8 have been known.

In the present paper, we obtain two putative infinite families of Hadamard matrices of order 4q² with q º 7\mod 8 prime. We believe that, for any large enough n, our constructions yield at least ⁵/₈n^2/₅ primes q < n, q º 7\mod16 such that a regular Hadamard matrices of order 4q² exists. Our approach is based on 16th and (q+1)th cyclotomic classes.

Abstract : In several recent papers Hoon Hong and Gutieerz addressed the problem of the behaviour of groebner bases under composition of polynomials..Adressing the problem of some Groebner bases under composition is extraordinary significant,we mainly probe into the behaviour of l-Groebner bases under composition.

Let k be a field,k[x₁,x₂,¼,x_n] be a polynomial ring in the variables x₁,x₂,¼,x_n with coefficient from k, > be a term ordering.Composition Q is the operation of replacing variable in a polynomial with other polynomials.

Let F be a finite set of polynomials in k[x₁,x₂,¼,x_n,] and let G be a Groebner basis of the ideal generated by F under the term ordering > .Let Q = (q₁,q₂,¼,q_n) be a list of n polynomials in k[x₁,x₂,¼,x_n].F°Q be the set obtained from F by replacing x_i by q_i.One ponders whether G°Q is also a Groebner basis of F°Q.If for any F,G;G°Q is also a Groebner basis of F°Q,we say Groebner basis computation commute with composition by Q.We ponder whether Groebner basis l-Groebner basis computation commute with composition b Q for some F's and G's.

Lemma 1^[6]    Groebner basis computation commute with composition by Q if and only if

(a)    "p "q,p > qÞ p°lt(q) > q°lt(q) > q°lt(q);and

(b)    the list lt(q) is a 'permuted powering',the ltq_i and ltq_j are pairwise relatively prime.

Let f,g Î k[x₁,x₂,¼,x_n],we denote the leading power product of f by lp(f),the leading coefficient of f by lc(f),the leading term of f by lt(f),that is,lt(f) = lc(f)lp(f).

Lemma 2 ^[1]    Let d be a greatest common divisor of f and g,then {f,g} is a Groebner basis if and only if lp(^g/_d) and lp(^g/_d) is relatively prime.

Theorem 1.    Let lp(f) = x₁^u₁x₂^u₂¼x_n^u_n, lp(g) = x₁^v₁x₂^v₂¼x_n^v_n,and there is k such that deg_xklp(f) = u_k ³ deg_xklp(g);then {f,g} is not a Groebner basis,or {f+h,g} is not a Groebner basis,here lp(h) < lp(f),deg_xklp(h) < deg_xklp(g).

Theorem 2.    If deg_xklp(f) ¹ 0,  deg_xklp(g) ¹ 0,for any integer l > 0,then there are integers l,m,s such that {f^m,g^s} is not a Groebner basis,and or {f^m+f^l,g^s} is not a Groebner basis.

Let t₁,t₂,¼,t_s are all items of f,if degt_i ³ l,"i;we call that f l-degree.Let G = {g₁,g₂.¼,g_s} be a Groebner basis,if "g_i,g_i¢s are l-degree,we call that G l-Groebner basis.

Theorem 3.    l-Groebner basis computation commute with composition by Q if and only if

(a)   "p "q,  degp.degq ³ l,  p > qÞ p°lt(q) > q°lt(q);and

(b)   the list lt(q) is a 'powering'.

Reference

[1] Adams,W., Loustaunau, P., An Introduction to Gröbner Bases, Graduate Studies in Mathematics 3, Amer.Math.Soc., Providence, 1994.

[2] Becker,T. and Weispfenning,V.: Gröbner Bases-A Computational Approach to Commutative Algebra, GTM 141, New York: Springer, 1993.

[3] Gutierrez,J.,etc. Reduced Gröbner bases under composition, J. Symb. Comput. 26, 433-444, 1998.

[4] Greuel,G., Pfister,G., Advances and improvements in the theory of standars bases and syzybies, Arch.Math., Vol.66, 163-176, 1906.

[5] Gräbe,H., The tangent cone algorithm and homogeization, J.pure Applied Algebra, Vol.97, 303-312, 1994.

[6] Hong,H: Gröner Bases Under Composition I, J. Symb. Comput., 25, 643-663, 1978.

[7] Jinwang,L.: The term orderings which are compatible with comosition II, J. Smb. Comput,(2003).35,153-168.

Abstract : Let S be a regular semigroup. An inverse subsemigroup S^° of S is called an inverse transversal of S if S^° contains a unique inverse x^° of each element x of S. An inverse transversal S^° of S is called a Q-inverse transversal of S if S^° is a quasi-ideal of S. A regular biordered set E is an IT-biordered set if there is a regular semigroup S with sets of idempotent E and S has inverse transversals. The class of regular semigroups with inverse transversals contains inverse semigroups, completely simple semigroups, etc..

The representations for regular semigroups by means their biordered sets are very important in theoretical of semigroups. In this paper, we gives representations for the class of regular biordered sets firstly. On the basis of it, and give the representations for IT-biordered sets and their regular semigroups. The representation for a fully fundamental regular semigroups of an IT-biordered set is an analogue of the Munn representations on semilattices or the Hall representations on bands.

Abstract : Let f be a degeneration of Kähler manifolds. The Clemens-Schmid exact sequence studies the Picard-Lefchetz transformation and gain some important properties of the degeneration. In hope of gaining more information of the degeneration, we survey the possibility of generalizing classical (abelian) Clemens-Schmid exact sequence to non-abelian one. We will provide ``counterexamples'' to show that we cannot use the same formulation as in abelian case. Some notions of non-abelian Clemens-Schmid exact sequences will be discussed.

Abstract : We discuss unique range sets, uniqueness polynomials, and other uniqueness problems for entire functions and meromophic functions. We also study their analogous problems for number fields.

Abstract : In this paper, we give the concepts of hyperlattice, subhyperlattice, and complemented hyperlattice, and study a few results in these aspects. We also give the definitions of homomorphism and isomorphism of hyperlattices, then investigate a series of properties of hyperlattice.

Keywords: hyperlattice; distributive hyperlattice; complemented hyperlattice

MSC: 06B99

Abstract : Let k be a function field of one variable over a finite field, ¥ a fixed prime divisor of k, and let A be the ring of the elements of k which are integral at all primes of k other than ¥. Let K be an A-field of finite A-characteristic and let f be a rank one Drinfeld A-module over K. Given a Î K, we show that the set

Abstract : In this paper, we introduce several matrices to describe the relations among the Külshammer-Robinson basis, projective modules, the ordinary irreducible characters and Brauer irreducible characters. We show that there are various equalities of Cartan matrices, decomposition matrices of the blocks according to the local blocks via Brauer correspondence. By using these equalities, we prove that there are several inequalities about the ordinary irreducible characters and Brauer irreducible characters, which imply their new relations and pure group results. Some results are given to describe the relations between generalized characters and Külshammer-Robinson basis.

f Research partially supported by CNSF and CSC.

Abstract : Let D(x) denote the error term of the Dirichlet divisor problem . Dirichlet first proved D(x) = O(x^1/2). The exponent 1/2 was improved by many authors. The latest result is D(x) << x^131/416(logx)^26957/8320 proved by Huxley. The conjectured bound is D(x) = O(x^1/4+e), which is supported by the classical mean-square formula of D(x). Tsang established the asymptotic formulas of the third- and fourth-power moments of D(x). Now we established the asymptotic formula of the k-th power moment of D(x) for each k Î {5,6,7,8,9}.