No description available.

No description available.

A tournament graph G is a vertex set V of size n, together with a directed edge set E ⊂ V × V such that (i, j) ∈ E if and only if (j, i) ∉ E for all distinct i, j ∈ V and (i, i) ∉ E for all i ∈ V. We explore the following generalization: For a fixed k we orient every k-subset of V by assigning it an orientation. That is, every facet of the (k − 1)-skeleton of the (n − 1)-dimensional simplex on V is given an orientation. In this dissertation we bound the number of compatible k-simplices, that is we bound the number of k-simplices such that its (k − 1)-faces with the already-specified orientation form an oriented boundary. We prove lower and upper bounds for all k ≥ 3. For k = 3 these bounds agree when the number of vertices n is q or q + 1 where q is a prime power congruent to 3 modulo 4. We also prove some lower bounds for values k > 3 and analyze the asymptotic behavior.

Bibliography: leaves 90-93.

<p>Given a positive integer k, Conrey, Farmer, Keating, Rubinstein and Snaith conjectured a formula for the asymptotics of the k-th moments of the central values of quadratic Dirichlet L-functions. The conjectured formula for the moments is expressed as sum of a k(k+1)/2 degree polynomial in log |d|. In the sum, d varies over the set of fundamental discriminants. This polynomial, called the moment polynomial, is given as a k-fold residue. In Part I of this thesis, we derive explicit formulae for first k lower order terms of the moment polynomial.</p> <p> In Part II, we present a formula bounding the average of S(t,f), the remainder term in the formula for the number of zeros of an L-function, L(s,f), where f is a newform of weight k and level N. This is Turing's method applied to cuspforms. We carry out the improvements to Turing's original method including using techniques of Booker and Trudgian. These improvements have application to the numerical verification of the Riemann Hypothesis.</p>

In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are polynomials over Q in the so-called elementary prime symmetric functions, whose values lie in Z. The latter are defined on the nonnegative integers and take the values of the elementary symmetric functions applied to the multi-set of prime factors (with repetition) of an integer n. Initially we look at basic properties of prime symmetric functions, and consider analogues of questions posed for the usual sum of proper divisors function, such as those concerning perfect numbers or Aliquot sequences. We consider the inverse question of when, and in how many ways a number $n$ can be expressed as f(m) for certain prime symmetric functions f. Then we look at asymptotic formulae for the average orders of certain fundamental prime symmetric functions, such as the arithmetic function whose value at n is the sum of k-th powers of the prime divisors (with repetition) of n. For these last functions in particular, we also look at statistical results by comparing their distribution of values with the distribution of the largest prime factor dividing n. In addition to average orders, we look at the modular distribution of prime symmetric functions, and show that for a fundamental class, they are uniformly distributed over any fixed modulus. Then our focus shifts to the related area of partitions into prime powers. We compute the appropriate asymptotic formulae, and demonstrate important monotonicity properties. We conclude by looking at iteration problems for some of the simpler prime symmetric functions. In doing so, we consider the empirical basis for certain conjectures, and are left with many open problems.

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

<p>Given a positive integer k, Conrey, Farmer, Keating, Rubinstein and Snaith conjectured a formula for the asymptotics of the k-th moments of the central values of quadratic Dirichlet L-functions. The conjectured formula for the moments is expressed as sum of a k(k+1)/2 degree polynomial in log |d|. In the sum, d varies over the set of fundamental discriminants. This polynomial, called the moment polynomial, is given as a k-fold residue. In Part I of this thesis, we derive explicit formulae for first k lower order terms of the moment polynomial.</p> <p> In Part II, we present a formula bounding the average of S(t,f), the remainder term in the formula for the number of zeros of an L-function, L(s,f), where f is a newform of weight k and level N. This is Turing's method applied to cuspforms. We carry out the improvements to Turing's original method including using techniques of Booker and Trudgian. These improvements have application to the numerical verification of the Riemann Hypothesis.</p>

In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are polynomials over Q in the so-called elementary prime symmetric functions, whose values lie in Z. The latter are defined on the nonnegative integers and take the values of the elementary symmetric functions applied to the multi-set of prime factors (with repetition) of an integer n. Initially we look at basic properties of prime symmetric functions, and consider analogues of questions posed for the usual sum of proper divisors function, such as those concerning perfect numbers or Aliquot sequences. We consider the inverse question of when, and in how many ways a number $n$ can be expressed as f(m) for certain prime symmetric functions f. Then we look at asymptotic formulae for the average orders of certain fundamental prime symmetric functions, such as the arithmetic function whose value at n is the sum of k-th powers of the prime divisors (with repetition) of n. For these last functions in particular, we also look at statistical results by comparing their distribution of values with the distribution of the largest prime factor dividing n. In addition to average orders, we look at the modular distribution of prime symmetric functions, and show that for a fundamental class, they are uniformly distributed over any fixed modulus. Then our focus shifts to the related area of partitions into prime powers. We compute the appropriate asymptotic formulae, and demonstrate important monotonicity properties. We conclude by looking at iteration problems for some of the simpler prime symmetric functions. In doing so, we consider the empirical basis for certain conjectures, and are left with many open problems.

Thesis (M. Sc.)--University of Adelaide, 1987. / Includes bibliographical references (leaves 90-93).