The odd and even intersection properties

A non-empty family S of subsets of a finite set A has the odd (respectively, even) intersection property if there exists non-empty B subset of A with vertical bar B boolean AND S vertical bar odd (respectively, even) for each S is an element of S. In characterizing sets of integers that are quadratic nonresidues modulo infinitely many primes, Wright asked for the number of such S, as a function of vertical bar A vertical bar. We give explicit formulae

Sign Ambiguities of Gaussian Sums

In 1934, two kinds of multiplicative relations, extit{norm and Davenport-Hasse} relations, between Gaussian sums, were known. In 1964, H. Hasse conjectured that the norm and Davenport-Hasse relations are the only multiplicative relations connecting the Gaussian sums over $mathbb F_p$. However, in 1966, K. Yamamoto provided a simple counterexample disproving the conjecture when Gaussian sums are considered as numbers. This counterexample was a new type of multiplicative relation, called a {it sign ambiguity} (see Definition ef{defi:of_sign_ambi}), involving a $pm$ sign not connected to elementary properties of Gauss sums. In Chapter $5$, we provide an explicit product formula giving an infinite class of new sign ambiguities and we resolve the ambiguous sign by using the Stickelberger\u27s theorem

Prime number races

Sous l’hypothèse de Riemann généralisée et l’hypothèse d’indépendance linéaire, Rubinstein et Sarnak ont prouvé que les valeurs de x > 1 pour lesquelles nous avons plus de nombres premiers de la forme 4n + 3 que de nombres premiers de la forme 4n + 1 en dessous de x ont une densité logarithmique d’environ 99,59%. En général, l’étude de la différence #{p < x : p dans A} − #{p < x : p dans B} pour deux sous-ensembles de nombres premiers A et B s’appelle la course entre les nombres premiers de A et de B. Dans ce mémoire, nous cherchons ultimement à analyser d’un point de vue numérique et statistique la course entre les nombres premiers p tels que 2p + 1 est aussi premier (aussi appelés nombres premiers de Sophie Germain) et les nombres premiers p tels que 2p − 1 est aussi premier. Pour ce faire, nous présentons au préalable l’analyse de Rubinstein et Sarnak pour pouvoir repérer d’où vient le biais dans la course entre les nombres premiers 1 (mod 4) et les nombres premiers 3 (mod 4) et émettons une conjecture sur la distribution des nombres premiers de Sophie Germain.Under the Generalized Riemann Hypothesis and the Linear Independence Hypothesis, Rubinstein and Sarnak proved that the values of x which have more prime numbers less than or equal to x of the form 4n + 3 than primes of the form 4n + 1 have a logarithmic density of approximately 99.59%. In general, the study of the difference #{p < x : p in A} − #{p < x : p in B} for two subsets of the primes A and B is called the prime number race between A and B. In this thesis, we will analyze the prime number race between the primes p such that 2p + 1 is also prime (these primes are called the Sophie Germain primes) and the primes p such that 2p − 1 is also prime. To understand this, we first present Rubinstein and Sarnak’s analysis to understand where the bias between primes that are 1 (mod 4) and the ones that are 3 (mod 4) comes from and give a conjecture on the distribution of Sophie Germain primes

Design of tch-type sequences for communications

This thesis deals with the design of a class of cyclic codes inspired by TCH codewords. Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract algebra, namely group theory and number theory, constitute the first part of the thesis. By exploring group geometric properties and identifying an equivalence between some operations on codes and the symmetries of the dihedral group we were able to simplify the generation of codewords thus saving on the necessary number of computations. Moreover, we also presented an algebraic method to obtain binary generalized TCH codewords of length N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic isomorphism we developed a method that is both faster and less complex than what was proposed before. In addition, it is valid for all relevant cases relating the codeword length N and not only those resulting from N = p