On the Newton polygons of twisted L-functions of binomials

Let χ be an order c multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and T-adic Newton polygons of f. When $p>(d-e)(2d-1)$, we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on $p\mathrm{mod}cd$.We conjecture that this condition holds if p is large enough with respect to $c,d$ by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for $e=d-1$.     

A Generalization of Regular Left Acts

ＡＧｅｎｅｒａｌｉｚａｔｉｏｎｏｆＲｅｇｕｌａｒＬｅｆｔＡｃｔｓ＊）ＬｉｕＺｈｏｎｇｋｕｉ（刘仲奎）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮｏｒｔｈｗｅｓｔＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｌａｎｚｈｏｕ，７３００７０）Ｊ．Ａｈｓａｎ（Ｄ...     

蕴涵代数与BCK代数

系统研究 Fuzzy蕴涵代数与 BCK代数之间的关系 ,给出 MV代数与 BCK代数之间的联系 ,建立正则 FI代数和对合 BCK代数的对偶代数     

Regular Balanced Cayley Maps for Cyclic, Dihedral and Generalized Quaternion Groups

A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified.     

Remarks on the Regularity to 3-D Ideal Magnetohydrodynamic Equations

In this paper we are interested in the sufficient conditions which guarantee the regularityof solutions of 3-D ideal magnetohydrodynamic equations in the arbitrary time interval [0,T].Fivesufficient conditions are given.Our results are motivated by two main ideas:one is to control theaccumulation of vorticity alone;the other is to generalize the corresponding geometric conditions of3-D Euler equations to 3-D ideal magnetohydrodynamic equations.     

On the stability of some integer programming algorithms

In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.     

Extreme behavior of bivariate elliptical distributions

This paper exploits a stochastic representation of bivariate elliptical distributions in order to obtain asymptotic results which are determined by the tail behavior of the generator. Under certain specified assumptions, we present the limiting distribution of componentwise maxima, the limiting upper copula, and a bivariate version of the classical peaks over threshold result.