No abstract uploaded!

No abstract uploaded!

We define the Heegner--Drinfeld cycle on the moduli stack of Drinfeld Shtukas of rank two with r-modifications for an even integer r. We prove an identity between (1) The r-th central derivative of the quadratic base change L-function associated to an everywhere unramified cuspidal automorphic representation π of PGL2; (2) The self-intersection number of the π-isotypic component of the Heegner--Drinfeld cycle. This identity can be viewed as a function-field analog of the Waldspurger and Gross--Zagier formula for higher derivatives of L-functions.

No abstract uploaded!

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three nonzeros. Recently, the authors of [37]constructed a class of cyclic codes with arbitrary number of nonzeros, and computed the weight distribution for several cases. In this paper, we determine the weight distribution for a new family of such codes. This is achieved by introducing certain new methods, such as the theory of Jacobi sums over finite fields and subtle treatment of some complicated combinatorial identities.

In this paper we derived a nice general formula for the local integrals of triple product formula whenever one of the representations has sufficiently higher level than the other two. As an application we generalized Venkatesh and Woodbury’s work on the subconvexity bound of triple product L-function in level aspect, allowing joint ramifications, higher ramifications, general unitary central characters and general special values of local epsilon factors.

No abstract uploaded!

No abstract uploaded!

In this article, we define a “ recursive local” algorithm in order to construct two reccurent numerical sequences of positive prime numbers (𝑈2𝑛) and (𝑉2𝑛), ((𝑈2𝑛) function of (𝑉2𝑛)), such that for any integer n≥ 2, their sum is 2n. To build these , we use a third sequence of prime numbers (𝑊2𝑛) defined for any integer n≥ 3 by : 𝑊2𝑛 = Sup(p∈IP : p ≤ 2n-3), where IP is the infinite set of positive prime numbers. The Goldbach conjecture has been verified for all even integers 2n between 4 and 4.1018. . In the Table of Goldbach sequence terms given in paragraph § 10, we reach values of the order of 2n= 101000 . Thus, thanks to this algorithm of “ascent and descent”, we can validate the strong Euler-Goldbach conjecture.

We extend two results about the ordinary continued fraction expansion to best simultaneous Diophantine approximations of vectors or matrices. The first is Levy-Khintchin Theorem about the almost sure growth rate of the denominators of the convergents. The second is a Theorem of Bosma, Hendrik and Wiedijk about the almost sure limit distribution of the sequence of products q_n d(q_n θ,Z) where the qn's are the denominators of the convergents associated with the real number θ by the ordinary continued fraction algorithm. Beside these two main results, we show that when d≥2, for almost all vectors θ∈R^d, lim inf_{n→∞} q_{n+k} d(q_n θ,Z^d)=0 for all positive integers k, where (q_n)_{n∈N} is the sequence of best approximation denominators of θ.