Consider either (i) f = f1 ⊠ f2 for two Maass cusp forms for SLm(ℤ) and SLm′(ℤ), respectively, with 2 ≤ m ≤ m′, or (ii) f= f1 ⊠ f2 ⊠ f3 for three weight 2k holomorphic cusp forms for SL2(ℤ). Let λf(n) be the normalized coefficients of the associated L-function L(s, f), which is either (i) the Rankin-Selberg L-function L(s, f1 ×f2), or (ii) the Rankin triple product L-function L(s, f1 ×f2 ×f3). First, we derive a Voronoi-type summation formula for λf (n) involving the Meijer G-function. As an application we obtain the asymptotics for the smoothly weighted average of λf (n) against e(αnβ), i.e. the asymptotics for the associated resonance sums. Let ℓ be the degree of L(s, f). When β = 1/ℓ and α is close or equal to ±ℓq 1/ℓ for a positive integer q, the average has a main term of size |λf (q)|X 1/2ℓ+1/2 . Otherwise, when α is fixed and 0 < β < 1/ℓ it is shown that this average decays rapidly. Similar results have been established for individual SLm(ℤ) automorphic cusp forms and are due to the oscillatory nature of the coefficients λf (n).

No description available.

No description available.

One main goal of this thesis is to show that for every K it is possible to find K consecutive natural numbers that cannot be written as sums of three nonnegative cubes. Since it is believed that approximately 10% of all natural numbers can be written in this way, this result indicates that the sums of three cubes distribute unevenly on the real line. These sums have been studied for almost a century, in relation with Waring's problem, but the existence of ``arbitrarily long gaps'' between them was not known. We will provide two proofs for this theorem. The first is relatively elementary and is based on the observation that the sums of three cubes have a positive bias towards being cubic residues modulo primes of the form p=1+3k. Thus, our first method to find consecutive non-sums of three cubes consists in searching them among the natural numbers that are non-cubic residues modulo ``many'' primes congruent to 1 modulo 3. Our second proof is more technical: it involves the computation of the Sato-Tate distribution of the underlying cubic Fermat variety {x^3+y^3+z^3=0}, via Jacobi sums of cubic characters and equidistribution theorems for Hecke L-functions of the Eisenstein quadratic number field Q(\sqrt{-3}). The advantage of the second approach is that it provides a nearly optimal quantitative estimate for the size of gaps: if N is large, there are >>\sqrt{log N}/(log log N)^4 consecutive non-sums of three cubes that are less than N. According to probabilistic models, an optimal estimate would be of the order of log N / log log N. In this thesis we also study other gap problems, e.g. between sums of four fourth powers, and we give an application to the arithmetic of cubic and biquadratic theta series. We also provide the following additional contributions to Number Theory and Combinatorics: a derivation of cubic identities from a parameterization of the pseudo-automorphisms of binary quadratic forms; a multiplicity estimate for multiprojective Chow forms, with applications to Transcendental Number Theory; a complete solution of a problem on planar graphs with everywhere positive combinatorial curvature.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE / Includes bibliographical references. / by Ilan Vardi. / Ph.D.

Ce travail met en jeu plusieurs systèmes dynamiques sur des tores en dimension finie, pour lesquels on sait établir des théorèmes limites, qui permettent de préciser leur comportement stochastique. On généralise d'abord le théorème limite local usuel sur un sous-shift de type fini, en ajoutant un terme de perturbation, en reprenant la preuve classique, par des techniques d'opérateurs. On en déduit un théorème limite local pour les sommes de « Riesz-Raïkov unitaires étendues », et des observables höldériennes. Pour cela, on reprend une méthode employée par Bernard Petit, en utilisant des codages symboliques, et le théorème limite local avec perturbation. Puis, on présente plusieurs situations de composées d'automorphismes hyperboliques du tore en dimension deux pour lesquelles on sait établir un théorème limite central quelque soit le choix de la composée. En particulier, on aborde le cas des matrices à coefficients entiers positifs.

In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and shortly after, in 1981, a simplified and more efficient versionwas presented by H.W. Lenstra for the Bourbaki Seminar. Later, in 2008, ReneSchoof presented an updated version of Lenstra's primality test. This thesis presents adetailed description of the cyclotomic primality test as described by Schoof, along withsuggestions for implementation. The cornerstone of the test is a prime congruencerelation similar to Fermat's little theorem" that involves Gauss or Jacobi sumscalculated over cyclotomic fields. The algorithm runs in very nearly polynomial time.This primality test is currently one of the most computationally efficient tests and isused by default for primality proving by the open source mathematics systems Sageand PARI/GP. It can quickly test numbers with thousands of decimal digits.

The theme of this thesis is combinatorics, complex analysis and algebraic geometry. The thesis consists of six articles divided into four parts. Part A: Spectral properties of the Schrödinger equation This part consists of Papers I-II, where we study a univariate Schrödinger equation with a complex polynomial potential. We prove that the set of polynomial potentials that admit solutions to the Schrödingerequation is connected, under certain boundary conditions. We also study a similar result for even polynomial potentials, where a similar result is obtained. Part B: Graph monomials and sums of squares In this part, consisting of Paper III, we study natural bases for the space of homogeneous, symmetric and translation-invariant polynomials in terms of multigraphs. We find all multigraphs with at most six edges that give rise to non-negative polynomials, and which of these that can be expressed as a sum of squares. Such polynomials appear naturally in connection to expressing certain non-negative polynomials as sums of squares. Part C: Eigenvalue asymptotics of banded Toeplitz matrices This part consists of Papers IV-V. We give a new and generalized proof of a theorem by P. Schmidt and F. Spitzer concerning asymptotics of eigenvalues of Toeplitz matrices. We also generalize the notion of eigenvalues to rectangular matrices, and partially prove the a multivariate analogue of the above. Part D: Stretched Schur polynomials This part consists of Paper VI, where we give a combinatorial proof that certain sequences of skew Schur polynomials satisfy linear recurrences with polynomial coefficients. / <p>At the time of doctoral defence the following papers were unpublished and had a status as follows: Paper 5: Manuscript; Paper 6: Manuscript</p>

No description available.

Thesis (Ph.D.)--University of Delaware, 2008. / Principal faculty advisor: Qing Xiang, Dept. of Mathematical Sciences. Includes bibliographical references.