Displaying 21 – 40 of 58

Showing per page

Gauss Sums of Cubic Characters over p r , p Odd

Davide Schipani, Michele Elia (2012)

Bulletin of the Polish Academy of Sciences. Mathematics

An elementary approach is shown which derives the values of the Gauss sums over p r , p odd, of a cubic character. New links between Gauss sums over different field extensions are shown in terms of factorizations of the Gauss sums themselves, which are then revisited in terms of prime ideal decompositions. Interestingly, one of these results gives a representation of primes p of the form 6k+1 by a binary quadratic form in integers of a subfield of the cyclotomic field of the pth roots of unity.

Gauss Sums of the Cubic Character over G F ( 2 m ) : an Elementary Derivation

Davide Schipani, Michele Elia (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

By an elementary approach, we derive the value of the Gauss sum of a cubic character over a finite field 2 s without using Davenport-Hasse’s theorem (namely, if s is odd the Gauss sum is -1, and if s is even its value is - ( - 2 ) s / 2 ).

Incomplete character sums and a special class of permutations

S. D. Cohen, H. Niederreiter, I. E. Shparlinski, M. Zieve (2001)

Journal de théorie des nombres de Bordeaux

We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.

Linear congruences and a conjecture of Bibak

Chinnakonda Gnanamoorthy Karthick Babu, Ranjan Bera, Balasubramanian Sury (2024)

Czechoslovak Mathematical Journal

We address three questions posed by K. Bibak (2020), and generalize some results of K. Bibak, D. N. Lehmer and K. G. Ramanathan on solutions of linear congruences i = 1 k a i x i b ( mod n ) . In particular, we obtain explicit expressions for the number of solutions, where x i ’s are squares modulo n . In addition, we obtain expressions for the number of solutions with order restrictions x 1 x k or with strict order restrictions x 1 > > x k in some special cases. In these results, the expressions for the number of solutions involve Ramanujan...

Currently displaying 21 – 40 of 58