This thesis shows that Gram's Law and the Rosser Rule (methods for locating zeroes of the Riemann zeta-function) fail in a positive proportion of cases. A weaker version of Gram's Law is shown to be true in a positive proportion of cases. Also included are theorems on Turing's Method and its extensions to Dirichlet L-functions and Dedekind zeta-functions.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2016-02-23T11:48:48Z No. of bitstreams: 2 Dissertação - Uender Barbosa de Souza - 2015.pdf: 1080400 bytes, checksum: b157d208d7fefbd962ec5263785ee984 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-02-23T11:50:57Z (GMT) No. of bitstreams: 2 Dissertação - Uender Barbosa de Souza - 2015.pdf: 1080400 bytes, checksum: b157d208d7fefbd962ec5263785ee984 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2016-02-23T11:50:57Z (GMT). No. of bitstreams: 2 Dissertação - Uender Barbosa de Souza - 2015.pdf: 1080400 bytes, checksum: b157d208d7fefbd962ec5263785ee984 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-04-29 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This paper presents methods to calculate some in nite sums and use the Fourier series of function f(x) = x2p with p 2 N to get results on the behavior of Zeta(2p) function Riemann, including their sum and rational multiplicity of 2p. / Neste trabalho apresentamos métodos para o cálculo de algumas somas in nitas e usamos a série de Fourier da função f(x) = x2p com p 2 N para obter resultados sobre o comportamento da função Zeta(2p) de Riemann, tais como sua soma e sua multiplicidade racional por 2p.

In recent years, the moments of L-functions has been a topic of growing interest in the field of analytic number theory. New techniques, including applications of Random Matrix Theory and multiple Dirichlet series, have lead to many well-posed theorems and conjectures for the moments of various L-functions. In this thesis, we theoretically and numerically examine the integral moments of quadratic Dirichlet $L$-functions. In particular, we exhibit and discuss the conjectures for the moments which result from the applications of Random Matrix Theory, number theoretic heuristics, and the theory of multiple Dirichlet series. In the case of the cubic moment, we further numerically investigate the possible existence of additional lower order main terms.

In recent years, the moments of L-functions has been a topic of growing interest in the field of analytic number theory. New techniques, including applications of Random Matrix Theory and multiple Dirichlet series, have lead to many well-posed theorems and conjectures for the moments of various L-functions. In this thesis, we theoretically and numerically examine the integral moments of quadratic Dirichlet $L$-functions. In particular, we exhibit and discuss the conjectures for the moments which result from the applications of Random Matrix Theory, number theoretic heuristics, and the theory of multiple Dirichlet series. In the case of the cubic moment, we further numerically investigate the possible existence of additional lower order main terms.

When choosing k random elements from a group the kth expectation number is the expected size of the subgroup generated by those specific elements. The main purpose of this thesis is to study the asymptotic properties for the first and second expectation numbers of large cyclic groups. The first chapter introduces the kth expectation number. This formula allows us to determine the expected size of any group. Explicit examples and computations of the first and second expectation number are given in the second chapter. Here we show example of both cyclic and dihedral groups. In chapter three we discuss arithmetic functions which are crucial to computing the first and second expectation numbers. The fourth chapter is where we introduce and prove asymptotic results for the first expectation number of large cyclic groups. The asymptotic results for the second expectation number of cyclic groups is given in the fifth chapter. Finally, the results are summarized and future work for expectation numbers is discussed.

No description available.

Sudėtinės funkcijos universalumo įrodymas. / Bachelor thesis about universality of one composite function.

Darbe įrodyta, kad Hurvico dzeta funkcijai su algebriniu parametru yra teisinga ribinė teorema su svoriu kompleksinėje plokštumoje. Pagrindinis šio darbo rezultatas yra suformuluotas teorema. / Proof of limit theorem with weight for the Hurwitz zeta-function with an algebraic irrational parameter. The rezult formulated by theorem.

Constrained codes have been used in data storage systems, such as magnetic tapes, CD’s and DVD’s, in order to reduce the likelihood of errors by predictable noise. The study of constrained codes is based on the study of sofic shifts, which are sets of bi-infinite sequences that can be presented using labeled directed graphs called presentations. In this thesis, we will primarily focus on two classes of sofic shifts, namely shifts of finite type (SFT’s) and periodic-finite-type shifts (PFT’s), and examine their properties. We first consider Shannon covers of sofic shifts. A Shannon cover of a sofic shift is a deterministic presentation with the smallest number of vertices among all deterministic presentations of the shift. Indeed, a Shannon cover is used as a canonical presentation of a sofic shift, and furthermore, it is used when computing the capacity of the shift or when constructing a finite-state encoder. We follow an algorithm by Crochemore, Mignosi and Restivo which constructs a deterministic presentation of an SFT and we see how to derive a Shannon cover from the presentation under their algorithm. Furthermore, as a method to determine whether a given deterministic presentation is a Shannon cover of a sofic shift, we will provide, based on research by Jonoska, a sufficient condition for a given presentation to have the smallest number of vertices among all presentations of the shift. We then move our focus towards PFT’s, and investigate new properties of PFT’s from various perspectives. We define three types of periods that can be associated with a PFT and do pairwise comparisons between them. Also, we consider the zeta function of a PFT, which is a generating function for the number of periodic sequences in the PFT, and present a simple formula to compute the zeta function of a PFT. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2009-08-08 14:08:36.876

Darbe pateikta funkcijų tyrimo apžvalga, svarbiausi žinomi rezultatai, suformuluota problema. Pagrindinė ribinė teorema įrodoma, taikant tikimybinius metodus, analizinių funkcijų savybes, aproksimavimo absoliučiai konvertuojančiu integralu principą. / The main limit theorem is proved using probabilistic methods, the analytical functions of the properties.