In this licentiate thesis, we study the action of Hecke operators on Drinfeld cusp forms via the theory of crystals over function fields. The thesis contains one preliminary chapter, in which we recall some basic theory of Drinfeld modules and Drinfeld modular forms, as well as the Eichler-Shimura theory developed by Böckle. The core of the thesis consists of Chapter II, in which we prove a Lefschetz trace formula for crystals over stacks and deduce a Ramanujan bound for Drinfeld modular forms, and Chapter III, in which we compute traces and slopes of Hecke operators. We formulate several questions and conjectures based on our data. We also include an appendix in which we discuss the relationship between traces of an operator in positive characteristic and its eigenvalues.

L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de trois branches : théorie spectrale des graphes, géométrie et combinatoire des groupes et études des invariants de graphes. La notion de graphe d’expansions (invariant de graphes) est relativement récente, elle a été développée afin d’étudier la robustesse des réseaux de télécommunication. Il s’avère que la construction de familles infinies de graphes expanseurs est un problème difficile. Cette thèse traite principalement de la construction de nouvelles familles de tels graphes. Les graphes expanseurs possèdent des nombreuses applications en informatique, notamment dans la construction de certains algorithmes, en théorie de la complexité, sur les marches aléatoires (random walk), etc. En informatique théorique, ils sont utilisés pour construire des familles de codes correcteurs d’erreur. Comme nous l’avons déjà vu les familles d’expanseurs sont difficiles à construire. La plupart des constructions s'appuient sur des techniques algébriques complexes, principalement en utilisant des graphes de Cayley et des produit Zig-Zag. Dans cette thèse, nous présentons une nouvelle méthode de construction de familles infinies d’expanseurs en utilisant les G-graphes. Ceux-ci sont en quelque sorte une généralisation des graphes de Cayley. Plusieurs nouvelles familles infinies d’expanseurs sont construites, notamment la première famille d’expanseurs irréguliers. / Applying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graphs that have strongconnectivity properties. Expanders constructions have found extensive applications in bothpure and applied mathematics. Although expanders exist in great abundance, yet their explicitconstructions, which are very desirable for applications, are in general a hard task. Mostconstructions use deep algebraic and combinatorial approaches. Following the huge amountof research published in this direction, mainly through Cayley graphs and the Zig-Zagproduct, we choose to investigate this problem from a new perspective; namely by usingG-graphs theory and spectral hypergraph theory as well as some other techniques. G-graphsare like Cayley graphs defined from groups, but they correspond to an alternative construction.The reason that stands behind our choice is first a notable identifiable link between thesetwo classes of graphs that we prove. This relation is employed significantly to get many newresults. Another reason is the general form of G-graphs, that gives us the intuition that theymust have in many cases such as the relatively high connectivity property.The adopted methodology in this thesis leads to the identification of various approaches forconstructing an infinite family of expander graphs. The effectiveness of our techniques isillustrated by presenting new infinite expander families of Cayley and G-graphs on certaingroups. Also, since expanders stand in no single stem of graph theory, this brings us toinvestigate several closely related threads from a new angle. For instance, we obtain newresults concerning the computation of spectra of certain Cayley and G-graphs, and theconstruction of several new infinite classes of integral and Hamiltonian Cayley graphs.

Srinivasa Ramanujan (1887-1920) was one of the world's greatest mathematical geniuses. He work extensively in a branch of mathematics called "q-series". Around 1913, he found an important formula which now is known as Ramanujan's 1ψ1summation formula. The aim of this thesis is to investigate Ramanujan's 1ψ1summation formula and explore its applications to number theory and combinatorics. First, we consider several classical important results on elliptic functions and then give new proofs of these results using Ramanujan's 1ψ1 summation formula. For example, we will present a number of classical and new solutions for the problem of representing an integer as sums of squares (one of the most celebrated in number theory and combinatorics) in this thesis. This will be done by using q-series and Ramanujan's 1ψ1 summation formula. This in turn will give an insight into how Ramanujan may have proven many of his results, since his own proofs are often unknown, thereby increasing and deepening our understanding of Ramanujan's work.

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to zeta function regularization and explore more fully the relationship between operators in physics and classical zeta functions of mathematics. In so doing, we highlight intriguing connections to number theory that arise.

Dans cette thèse, on étudie deux types d’équations diophantiennes. Une première partie de notre étude porte sur la résolution des équations dites de Ramanujan-Nagell Cx2+ b2mD = yn. Une deuxième partie porte sur les équations dites de Ngell-Ljunggren xp+ypx+y = pezq incluant le cas diagonal p = q. Les nouveaux réesultats obtenus seront appliqués aux équations de la forme xp + yp = Bzq. L’équation de Catalan-Fermat (cas B = 1) fera l’objet d’un traitement à part. / In this thesis, we study two types of diophantine equations. A ?rst part of our study is about the resolution of the Ramanujan-Nagell equations Cx2 + b2mD = yn. A second part of our study is about the Nagell-Ljungren equations xp+yp x+y = pezq including the diagonal case p = q. Our new results will be applied to the diophantine equations of the form xp + yp = Bzq. The Fermat-Catalan equation (case B = 1) will be the subject of a special study.

Dans cette thèse, on étudie deux types d'équations diophantiennes. Une première partie de notre étude porte sur la résolution des équations dites de Ramanujan-Nagell $Cx^2+b^{2m}D=y^n$. Une deuxième partie porte sur les équations dites de Ngell-Ljunggren\\ $\frac{x^p+y^p}{x+y}=p^ez^q$ incluant le cas diagonal $p=q$. Les nouveaux résultats obtenus seront appliqués aux équations de la forme $x^p+y^p=Bz^q$. L'équation de Catalan-Fermat (cas $B=1$) fera l'objet d'un traitement à part.