Coding the principal character formula for affine Kac-Moody lie algebras

In this paper, an algorithm for computing the principal character for affine Lie algebras is discussed and presented. The principal characters discovered using this program are given and/or proven. Results include level 2 and 3 character formulas in and the sole existence of the Rogers-Ramanujan products in , , , , , , .     

Upper bounds on a two-term exponential sum*

We obtain upper bounds for mixed exponential sums of the type where p^m is a prime power with m⩾ 2 and X is a multiplicative character (mod p^m). If X is primitive or p⫮(a, b) then we obtain |S(χ,f,p ^m)| ⩽2np ^{2/3 m}. If X is of conductor p and p⫮( a, b) then we get the stronger bound |S(χ,f,p ^m)|⩽np ^m/2. This paper is dedicated to Prof. Wang Yuan on the occasion of his 70th birthday.     

Generalized Steiner Systems GS(2, 4, v, 2) with v a Prime Power ≡ 7 (mod 12)

Generalized Steiner systems GS(2, 4, v, g) were first introduced by Etzion and were used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 5, in which each codeword has length v and weight 4. Etzion conjectured that the necessary conditions v 1 (mod 3) and v ; 7 are also sufficient for the existence of a GS(2,4,v,2). Except for the example of a GS(2,4,10,2) and some recursive constructions given by Etzion, nothing else is known about this conjecture. In this paper, Weil's theorem on character sum estimates is used to show that the conjecture is true for any prime power v 7 (mod 12) except v = 7, for which there does not exist a GS(2,4,7,2).     

On a Problem of Dobrowolski and Williams and the Pólya-Vinogradov Inequality

In [2] E. Dobrowolski and K.S. Williams considered a problem of obtaining estimates for the sum _n=a+1 ^a+N f(n),for a certain class of functions f. One specific application of their result is a new method for estimating character sums. In particular, they obtain a form of the Pólya-Vinogradov inequality with the constant 1/(2 log 2). In this note we improve their estimates and obtain, in particular, a form of the Pólya-Vinogradov inequality with the constant 1/(3 log 3). A nice feature of our estimate is that it is obtained by a very simple argument.     

Derived Lengths of Solvable Groups Having Five Irreducible Character Degrees I

Let G be a solvable group with five character degrees. We show that the derived length of G is at most 5. This verifies that the Taketa inequality, dl(G)|cd(G)|, is valid for solvable groups with at most five character degrees.     

NOTES ON GLAISHER＇S CONGRUENCES

Let p be an odd prime and let n≥1,k≥0 and r be integers,denote by Bk the kth Bernoulli number,It is proved that(i) If r≥1 is odd and suppose 1≥r+4,then ∑j=1^p-1 1/(np+j)^r=-(2n+1)r(r+1)/2(r+2)Bp-r-2p^2(mod p^3).(ii)If r≥2 is even and suppose p≥r+3, then p-1∑j=1 1/(np+j)^r=r/r+1Bv-r-1p(mod P^2).(iii) p-1∑j=1 1/(np+j)p-2=-(2n+1)p(mod P^2).This result generalizes the Glaisher‘s congruence. As a corollary, a generalization of the Wolsten-holme‘s theorem is obtained.     

Perturbed Dolbeault operators and the homology Todd class

This paper discusses the role played by perturbed Dolbeault operators in relating the coherent sheaf and elliptic operator perspectives on the homology of projective varieties. Among the consequences are index formulas for perturbed Dolbeault operators.

     

Finite groups of matrices over group rings

We investigate certain finite subgroups of , where is a finite nilpotent group. Such a group gives rise to a -module; we study the characters of these modules to limit the structure of . We also exhibit some exotic subgroups .

     

基于DSP图形液晶显示器接口及程序设计

对基于DSP的图形液晶显示的研究做了一定的探讨,分析了基于DSP的图形液晶显示器的硬件电路以及程序设计。利用CCS开发环境,设计出一个基于DSP的图形液晶显示屏,能达到与程序运行相符合的显示结果。即通过更改、调试程序,最终实现静态显示、动态垂直向上向下滚屏显示、左右半屏从右至左逐字显示、全屏从左至右逐字显示汉字的功能,其他功能的实现有待进一步的研究。     

Performance evaluation of a new BPSK-OFDM timing estimation algorithm

Previously, the timing estimation in OFDM system employs cyclic prefix has been presented with the assumption of independent identified distributed OFDM symbol. The information used to find the symbol synchronization depends on the length of cyclic prefix. Actually, the data in the BPSK-OFDM modulated symbol, transferred by inverse fast Fourier transform, is with a complex symmetry character. With this character, more information from the whole OFDM symbol could be provided for the symbol timing. In this paper, the proposed algorithm uses the autocorrelation of the received signal to obtain the symbol timing. The simulation of Beek’s algorithm and the proposed scheme are presented. The performances of these algorithms are evaluated based on the missing symbol probability and the estimator mean square error. The simulation results show that the proposed algorithm is suitable to achieve a better symbol synchronization.