Waveguides in Euclidian space are piecewise path connected subsets of R^n that can be written as the union of a compact domain with boundary and their cylindrical ends. The compact and non-compact parts share a common boundary. This boundary is assumed to be Lipschitz, piecewise smooth and piecewise path connected. The ends can be thought of as the cartesian product of the boundary with the positive real half-line. A notable feature of Euclidian waveguides is that the scattering matrix admits a meromorphic continuation to a certain Riemann surface with a countably infinite number of leaves [2], which we will describe in detail and deal with. In order to construct this meromorphic continuation, one usually first constructs a meromorphic continuation of the resolvent for the Laplace operator. In order to do this, we will use a well known glueing construction (see for example [5]), which we adapt to waveguides. The construction makes use of the meromorphic Fredholm theorem and the fact that the resolvent for the Neumann Laplace operator on the ends of the waveguide can be easily computed as an integral kernel. The resolvent can then be used to construct generalised eigenfunctions and, from them, the scattering matrix. Being in possession of the scattering matrix allows us to calculate resonances; poles of the scattering matrix. We are able to do this using a combination of numerical contour integration and Newton s method.

In this thesis we prove several different results about the number of primes represented by linear functions. The Brun-Titchmarsh theorem shows that the number of primes which are less than x and congruent to a modulo q is less than (C+o(1))x/(phi(q)log{x}) for some value C depending on log{x}/log{q}. Different authors have provided different estimates for C in different ranges for log{x}/log{q}, all of which give C>2 when log{x}/log{q} is bounded. We show in Chapter 2 that one can take C=2 provided that log{x}/log{q}> 8 and q is sufficiently large. Moreover, we also produce a lower bound of size x/(q^{1/2}phi(q)) when log{x}/log{q}>8 and is bounded. Both of these bounds are essentially best-possible without any improvement on the Siegel zero problem. Let k>1 and Pi(n) be the product of k linear functions of the form a_in+b_i for some integers a_i, b_i. Suppose that Pi(n) has no fixed prime divisors. Weighted sieves have shown that for infinitely many integers n, the number of prime factors of Pi(n) is at most r_k, for some integer r_k depending only on k. In Chapter 3 and Chapter 4 we introduce two new weighted sieves to improve the possible values of r_k when k>2. In Chapter 5 we demonstrate a limitation of the current weighted sieves which prevents us proving a bound better than r_k=(1+o(1))klog{k} for large k. Zhang has shown that there are infinitely many intervals of bounded length containing two primes, but the problem of bounded length intervals containing three primes appears out of reach. In Chapter 6 we show that there are infinitely many intervals of bounded length containing two primes and a number with at most 31 prime factors. Moreover, if numbers with up to 4 prime factors have `level of distribution' 0.99, there are infinitely many integers n such that the interval [n,n+90] contains 2 primes and an almost-prime with at most 4 prime factors.

Each aspect of this thesis is motivated by the recent paper of Beresnevich, Dickinson and Velani (BDV03]. Let 'ljJ be a real, positive, decreasing function i.e. an approximation function. Their paper considers a general lim sup set A( 'ljJ), within a compact metric measure space (0, d, m), consisting of points that sit in infinitely many balls each centred at an element ROt of a countable set and of radius 'I/J(130) where 130 is a 'weight' assigned to each ROt. The classical set of 'I/J-well approximable numbers is the basic example. For the set A('ljJ) , [BDV03] achieves m-measure and Hausdorff measure laws analogous to the classical theorems of Khintchine and Jarnik. Our first results obtain an application of these metric laws to the set of 'ljJ-well approximable numbers with restricted rationals, previously considered by Harman (Har88c]. Next, we consider a generalisation of the set of badly approximable numbers, Bad. For an approximation function p, a point x of a compact metric space is in a general set Bad(p) if, loosely speaking, x 'avoids' any ball centred at an element ROt of a countable set and of radius c p(I3Ot) for c = c(x) a constant. In view of Jarnik's 1928 result that dim Bad = 1, we aim to show the general set Bad(p) has maximal Hausdorff dimension. Finally, we extend the theory of (BDV03] by constructing a general lim sup set dependent on two approximation functions, A('ljJll'ljJ2)' We state a measure theorem for this set analogous to Khintchine's (1926a) theorem for the Lebesgue measure of the set of ('l/Jl, 1/12)-well approximable pairs in R2. We also remark on the set's Hausdorff dimension.

L’objet de cette thèse est de démontrer que pour certaines représentations p : GK −! GLn(Fp) continues de GK, il existe un relèvement r : GK −! Gln (Zp) de p en une représentation cristalline. C’est un problème purement local, tout comme les méthodes utilisées pour le résoudre. / In this thesis, we prove that certain representations of the absolute Galois group of a finite extension of Qp with coefficients in Fp lift to crystalline representation with coefficients in Zp.

Le comptage de points de courbes algébriques est une primitive essentielle en théorie des nombres, avec des applications en cryptographie, en géométrie arithmétique et pour les codes correcteurs. Dans cette thèse, nous nous intéressons plus particulièrement au cas de courbes hyperelliptiques définies sur des corps finis de grande caractéristique $p$. Dans ce cas de figure, les algorithmes dérivés de ceux de Schoof et Pila sont actuellement les plus adaptés car leur complexité est polynomiale en $\log p$. En revanche, la dépendance en le genre $g$ de la courbe est exponentielle et se fait cruellement sentir même pour $g=3$. Nos contributions consistent principalement à obtenir de nouvelles bornes pour la dépendance en $g$ de l'exposant de $\log p$. Dans le cas de courbes hyperelliptiques, de précédents travaux donnaient une borne quasi-quadratique que nous avons pu ramener à linéaire, et même constante dans le cas très particuliers de familles de courbes dites à multiplication réelle (RM). En genre $3$, nous avons proposé un algorithme inspiré de ceux de Schoof et de Gaudry-Harley-Schost dont la complexité, en général prohibitive, devient très raisonnable dans le cas de courbes RM. Nous avons ainsi pu réaliser des expériences pratiques et compter les points d'une courbe hyperelliptique de genre $3$ pour un $p$ de 64 bits / Counting points on algebraic curves has drawn a lot of attention due to its many applications from number theory and arithmetic geometry to cryptography and coding theory. In this thesis, we focus on counting points on hyperelliptic curves over finite fields of large characteristic $p$. In this setting, the most suitable algorithms are currently those of Schoof and Pila, because their complexities are polynomial in $\log q$. However, their dependency in the genus $g$ of the curve is exponential, and this is already painful even in genus 3. Our contributions mainly consist of establishing new complexity bounds with a smaller dependency in $g$ of the exponent of $\log p$. For hyperelliptic curves, previous work showed that it was quasi-quadratic, and we reduced it to a linear dependency. Restricting to more special families of hyperelliptic curves with explicit real multiplication (RM), we obtained a constant bound for this exponent.In genus 3, we proposed an algorithm based on those of Schoof and Gaudry-Harley-Schost whose complexity is prohibitive in general, but turns out to be reasonable when the input curves have explicit RM. In this more favorable case, we were able to count points on a hyperelliptic curve defined over a 64-bit prime field

Cette thèse traite de deux problèmes dans le cadre du programme de Langlands. Pour le premier problème, dans la situation de $\GL_2 $ et un cocaractère non minuscule, nous fournissons un contre-exemple (sous certaines hypothèses naturelles) à la conjecture de Rapoport-Zink, communiquée par Laurent Fargues. Le deuxième problème concerne un résultat dans le programme de Langlands $p$-adique. Soit $A$ une algèbre $\qp$-affinoïde, au sens de Tate. Nous développons une théorie d'un espace localement convexe en $A$-modules parallèle au traitement dans le cas d'un corps par Schneider et Teitelbaum. Nous montrons qu'il existe une application d'intégration liant une catégorie de représentations localement analytiques en $A$ -modules et des modules de distribution séparés relatif. Il existe une théorie de cohomologie localement analytique pour ces objets et une version du Lemme de Shapiro. Dans le cas d'un corps, ceci a été substantiellement développé par Kohlhaase. Comme une application, nous proposons une correspondance de Langlands $p$-adique en families: Pour un $(\varphi, \Gamma)$-module trianguline et régulière de dimension 2 sur l'anneau de Robba relatif $\Robba_A$ nous construisons une $\GL_2(\qp)$-représentation localement analytique en $A$-modules. Il s'agit d'un travail en commun avec Joaquin Rodrigues. / This thesis deals with two problems within the Langlands program. For the first problem, in the situation of $\GL_2$ and a non-minuscule cocharacter, we provide a counter-example (under some natural assumptions) to the Rapoport-Zink conjecture, communicated to us by Laurent Fargues.The second problem deals with a result in the $p$-adic Langlands program. Let $A$ be a $\qp$-affinoid algebra, in the sense of Tate. We develop a theory of locally convex $A$-modules parallel to the treatment in the case of a field by Schneider and Teitelbaum. We prove that there is an integration map linking a category of locally analytic representations in $A$-modules and separately continuous relative distribution modules. There is a suitable theory of locally analytic cohomology for these objects and a version of Shapiro's Lemma. In the case of a field this has been substantially developed by Kohlhaase. As an application we propose a $p$-adic Langlands correspondence in families: For a regular trianguline $(\varphi,\Gamma)$-module of dimension 2 over the relative Robba ring $\Robba_A$ we construct a locally analytic $\GL_2(\qp)$-representation in $A$-modules. This is joint work with Joaquin Rodrigues.

Ce travail est consacré à l'étude de trois problèmes liés à l'évaluation de sommes de fonctions multiplicatives sur les entiers friables. On dit qu'un nombre entier n est y-friable si son plus grand facteur premier P(n) n'excède pas y. Dans une première partie, nous considérons une fonction multiplicative aléatoire au sens de Wintner, c'est-à-dire une fonction arithmétique multiplicative f supportée par les entiers sans facteur carré, telle que, pour tout entier premier p, f(p) est une variable aléatoire de Bernoulli prenant les valeurs +1 et -1 avec probabilité 1/2. Dans la continuité de travaux de Wintner, Erdös, Halasz, Lau, Tenenbaum et Wu, notre étude est dédiée à l'obtention d'une majoration presque sûre de la fonction sommatoire de f sur les entiers y-friables n'excédant pas x. Un second volet est dévolu à l'évaluation asymptotique des fonctions sommatoires de certaines fonctions multiplicatives, notamment la fonction phi d'Euler, sur les translatés des entiers friables. La méthode employée fait appel à des résultats de répartition des entiers friables dans les progressions arithmétiques. La troisième partie consiste en une étude de la loi moyenne de répartition des diviseurs des entiers friables. Nous établissons le glissement, lorsque le paramètre de friabilité u = (log x)/log y croît, depuis la loi de l'arcsinus (établie en 1979 dans les travaux de Dress, Deshouillers et Tenenbaum) jusqu'à une loi approximativement gaussienne. La loi limite obtenue s'exprime au moyen d'une convolution faisant apparaître les fonctions de Dickman / This dissertation is devoted to studying three problems, all linked to estimates for sums of multiplicative functions over friable integers. An integer n is called y-friable if its largest prime factor P(n) does not exceed y. In a first part, we consider a random multiplicative function in the sense of Wintner, i.e. a multiplicative arithmetic function f supported on squarefree integers and such that, for each prime p, f(p) is a Bernoulli random variable taking each value +1 and -1 with probability 1/2. Elaborating on previous works by Wintner, Erdös, Halasz, Lau, Tenenbaum and Wu, we investigate upper bounds for the summatory function of f over y-friable integers not exceeding x. In the second part, we provide asymptotic estimates for sums of certain multiplicative functions, including Euler's totient, over shifted friable integers. This study depends on the distribution of friable integers in arithmetic progressions. In the third part, we consider a friable extension of the Arcsine law for the mean distribution of the divisors of integers. The original study is due to Deshouillers, Dress and Tenenbaum (1979). We describe the limit law in terms of the Dickman functions and we show that, as the friability parameter u = (log x)/log y increases, the mean distribution drifts from the Arcsine law towards a Gaussian behaviour

Pour un n-uplet de nombres réels, vu comme un point de l'espace projectif, on définit pour chaqueindice d entre 0 et n-1 deux exposants d'approximation diophantienne (un ordinaire et un uniforme)qui mesurent l'approximabilité de celui-ci par des sous-espaces rationnels de dimension d dansl'espace projectif. Il se trouve que ces 2n exposants ne sont pas indépendants les uns des autres.Cette thèse s'inscrit dans l'étude du spectre de tout ou partie de ces exposants, qui a fait l'objet denombreux travaux récents. On utilise notamment les outils récents de la géométrie paramétriquedes nombres pour étudier le spectre des exposants uniforme, et on traite un cas pondéré endimension 2. / Given a n-tuple of real numbers, seen as a point in the projective space, one can define for eachindex d between 0 and n-1 two exponents of diophantine approximation (an ordinary and auniform) which measure the approximability of this n-tuple by rational subspaces of dimension d inthe projective space. These 2n exponents are not independant. This thesis is part of the study fromthe spectrum of all or part of these exponents, which have been much studied recently. We userecent tools coming from the parametric geometry of numbers to study the spectrum of the uniformexponents, and deal with a twisted case in dimension two.

The general scope of this thesis is aimed at investigating certain classes of discrete equations through the analysis of certain characteristics of the solutions of these equations. We construct new methods of analysis based on the growth of these characteristics that let us single out known integrable discrete equations from certain class of equations. These integrable discrete equations are discrete analogues of the famous Painleve equations.

Les gestionnaires des réseaux de transport d'électricité doivent adapter leurs outils d'aide à la décision aux avancées technologiques du XXIième siècle. Une opération sous-jacente à beaucoup d'outils est de calculer les flux en actif/réactif qui minimisent les pertes ou les coûts de production. Mathématiquement, il s'agit d'un problème d'optimisation qui peut être décrit en utilisant seulement l'addition et la multiplication de nombres complexes. L'objectif de cette thèse est de trouver des solutions globales. Un des aboutissements de ce projet doctoral hautement collaboratif est d'utiliser des résultats récents en géométrie algébrique pour calculer des flux optimaux dans le réseau Européen à haute tension. / Transmission system operators need to adapt their decision-making tools to the technological evolutions of the twenty first century. A computation inherent to most tools seeks to find alternating-current power flows that minimize power loss or generation cost. Mathematically, it consists in an optimization problem that can be described using only addition and multiplication of complex numbers. The objective of this thesis is to find global solutions, in other words the best solutions to the problem. One of the outcomes of this highly collaborative doctoral project is to use recent results from algebraic geometry to compute globally optimal power flows in the European high-voltage transmission network.