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 study a partially linearized version of the relative trace formula for the arithmetic Gan--Gross--Prasad conjecture for the unitary group U(V). The linear factor in this relative trace formula provides an SL_2-symmetry which allows us to prove by induction the arithmetic fundamental lemma over Q_p when p is odd and p ≥ dim V.

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.