Digital Commons Network^™

An Exposition Of The Deterministic Polynomial-Time Primality Testing Algorithm Of Agrawal-Kayal-Saxena, Robert Lawrence Anderson

Theses and Dissertations

I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.

Matrix Representations Of Automorphism Groups Of Free Groups, Ivan B. Andrus

Theses and Dissertations

In this thesis, we study the representation theory of the automorphism group Aut (Fn) of a free group by studying the representation theory of three finite subgroups: two symmetric groups, Sn and Sn+1, and a Coxeter group of type Bn, also known as a hyperoctahedral group. The representation theory of these subgroups is well understood in the language of Young Diagrams, and we apply this knowledge to better understand the representation theory of Aut (Fn). We also calculate irreducible representations of Aut (Fn) in low dimensions and for small n.

Statistical Properties Of Thompson's Group And Random Pseudo Manifolds, Benjamin M. Woodruff

Theses and Dissertations

The first part of our work is a statistical and geometric study of properties of Thompson's Group F. We enumerate the number of elements of F which are represented by a reduced pair of n-caret trees, and give asymptotic estimates. We also discuss the effects on word length and number of carets of right multiplication by a standard generator x0 or x1. We enumerate the average number of carets along the left edge of an n-caret tree, and use an Euler transformation to make some conjectures relating to right multiplication by a generator. We describe a computer algorithm which produces …

Classifying Homotopy Types Of One-Dimensional Peano Continua, Mark H. Meilstrup

Theses and Dissertations

Determining the homotopy type of one-dimensional Peano continua has been an open question of some interest. We give a complete invariant of the homotopy type of such continua, which consists of a pair of subspaces together with a relative homology group. Along the way, we describe reduced forms for one-dimensional Peano continua.

Three Pension Cost Methods Under Varying Assumptions, Linda S. Grizzle

Theses and Dissertations

A pension plan administrator promises certain benefits in the future in exchange for labor today. In order to budget for this expense and create more security for the participant, the administrator uses a pension cost method. Each cost method assigns a portion of the future liability to the current year. This is called the normal cost. We calculate the normal cost under three cost methods using different annuity, interest and inflation assumptions. Then we make comparisons between cost methods as well as between assumption changes. The cost methods considered in this paper are the unit credit cost method, projected unit …

Explicit Computations Supporting A Generalization Of Serre's Conjecture, Brian Francis Hansen

Theses and Dissertations

Serre's conjecture on the modularity of Galois representations makes a connection between two-dimensional Galois representations and modular forms. A conjecture by Ash, Doud, and Pollack generalizes Serre's to higher-dimensional Galois representations. In this paper we discuss an explicit computational example supporting the generalized claim. An ambiguity in a calculation within the example is resolved using a method of complex approximation.

The Lie Symmetries Of A Few Classes Of Harmonic Functions, Willis L. Petersen

Theses and Dissertations

In a differential geometry setting, we can analyze the solutions to systems of differential equations in such a way as to allow us to derive entire classes of solutions from any given solution. This process involves calculating the Lie symmetries of a system of equations and looking at the resulting transformations. In this paper we will give a general background of the theory necessary to develop the ideas of working in the jet space of a given system of equations, applying this theory to harmonic functions in the complex plane. We will consider harmonic functions in general, harmonic functions with …

Hopf Bifurcations And Horseshoes Especially Applied To The Brusselator, Steven R. Jones

Theses and Dissertations

In this paper we explore bifurcations, in particular the Hopf bifurcation. We study this especially in connection with the Brusselator, which is a model of certain chemical reaction-diffusion systems. After a thorough exploration of what a bifurcation is and what classifications there are, we give graphic representations of an occurring Hopf bifurcation in the Brusselator. When an additional forcing term is added, behavior changes dramatically. This includes the introduction of a horseshoe in the time map as well as a strange attractor in the system.

Wave Scattering From Infinite Cylindrical Obstacles Of Arbitrary Cross-Section, Matthew B. Weber

Theses and Dissertations

In this work the scattering of an incident plane wave propagating along a plane perpendicular to the xy-plane is studied. The wave is scattered from an infinitely long cylindrical object of arbitrary cross-section. Due to the arbitrary geometry of the obstacle, a finite differences numerical method is employed to approximate the solution of the scattering problems. The wave equation is expressed in terms of generalized curvilinear coordinates. Boundary conforming grids are generated using elliptic grid generators. Then, a explicit marching in time scheme is implemented over these grids. It is found that as time grows the numerical solution converges to …

A Numerical Scheme For Mullins-Sekerka Flow In Three Space Dimensions, Sarah Marie Brown

Theses and Dissertations

The Mullins-Sekerka problem, also called two-sided Hele-Shaw flow, arises in modeling a binary material with two stable concentration phases. A coarsening process occurs, and large particles grow while smaller particles eventually dissolve. Single particles become spherical. This process is described by evolving harmonic functions within the two phases with the moving interface driven by the jump in the normal derivatives of the harmonic functions at the interface. The harmonic functions are continuous across the interface, taking on values equal to the mean curvature of the interface. This dissertation reformulates the three-dimensional problem as one on the two-dimensional interface by using …

Psl(2,7)-Extensions With Certain Ramification At Two Primes, Glen E. Simpson

Theses and Dissertations

We conduct a parallel Hunter search in order to find a degree 7 number field K ramified at primes q and p with discriminant d(K)=q^6 p^2 where q=11 and 2

A New Approach To Lie Symmetry Groups Of Minimal Surfaces, Robert D. Berry

Theses and Dissertations

The Lie symmetry groups of minimal surfaces by way of planar harmonic functions are determined. It is shown that a symmetry group acting on the minimal surfaces is isomorphic with H × H^2 — the analytic functions and the harmonic functions. A subgroup of this gives a generalization of the associated family which is examined.

Ultraconnected And Critical Graphs, Jason Nicholas Grout

Theses and Dissertations

We investigate the ultraconnectivity condition on graphs, and provide further connections between critical and ultraconnected graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We give results from our exhaustive enumeration of ultraconnected graphs up to 11 vertices. Using techniques involving the Lovász theta parameter for graphs, we prove certain …

A Forbidden Subgraph Characterization Problem And A Minimal-Element Subset Of Universal Graph Classes, Michael D. Barrus

Theses and Dissertations

The direct sum of a finite number of graph classes H_1, ..., H_k is defined as the set of all graphs formed by taking the union of graphs from each of the H_i. The join of these graph classes is similarly defined as the set of all graphs formed by taking the join of graphs from each of the H_i. In this paper we show that if each H_i has a forbidden subgraph characterization then the direct sum and join of these H_i also have forbidden subgraph characterizations. We provide various results which in many cases allow us to exactly …

Problems Related To The Zermelo And Extended Zermelo Model, Benjamin Zachary Webb

Theses and Dissertations

In this thesis we consider a few results related to the Zermelo and Extended Zermelo Model as well as outline some partial results and open problems related thereto. First we will analyze a discrete dynamical system considering under what conditions the convergence of this dynamical system predicts the outcome of the Extended Zermelo Model. In the following chapter we will focus on the Zermelo Model by giving a method for simplifying the derivation of Zermelo ratings for tournaments in terms of specific types of strongly connected components. Following this, the idea of stability of a tournament will be discussed and …

Lattices And Their Applications To Rational Elliptic Surfaces, Gretchen Rimmasch

Theses and Dissertations

This thesis discusses some of the invariants of rational elliptic surfaces, namely the Mordell-Weil Group, Mordell-Weil Lattice, and another lattice which will be called the Shioda Lattice. It will begin with a brief overview of rational elliptic surfaces, followed by a discussion of lattices, root systems and Dynkin diagrams. Known results of several authors will then be applied to determine the groups and lattices associated with a given rational elliptic surface, along with a discussion of the uses of these groups and lattices in classifying surfaces.

Sandwich Theorem And Calculation Of The Theta Function For Several Graphs, Marcia Ling Riddle

Theses and Dissertations

This paper includes some basic ideas about the computation of a function theta(G), the theta number of a graph G, which is known as the Lovasz number of G. theta(G^c) lies between two hard-to-compute graph numbers omega(G), the size of the largest lique in a graph G, and chi(G), the minimum number of colors need to properly color the vertices of G. Lovasz and Grotschel called this the "Sandwich Theorem". Donald E. Knuth gives four additional definitions of theta, theta_1, theta_2, theta_3, theta_4 and proves that they are all equal.

First I am going to describe the proof of the …

Bounding The Number Of Graphs Containing Very Long Induced Paths, Steven Kay Butler

Theses and Dissertations

Induced graphs are used to describe the structure of a graph, one such type of induced graph that has been studied are long paths.

In this thesis we show a way to represent such graphs in terms of an array with two colors and a labeled graph. Using this representation and the techniques of Polya counting we will then be able to get upper and lower bounds for graphs containing a long path as an induced subgraph.

In particular, if we let P(n,k) be the number of graphs on n+k vertices which contains P_n, a path on n vertices, as …