Physical Sciences and Mathematics Commons^™

Recursive Methods In Number Theory, Combinatorial Graph Theory, And Probability, Jonathan Burns

USF Tampa Graduate Theses and Dissertations

Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms.

In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the …

Stochastic Modeling And Analysis Of Energy Commodity Spot Price Processes, Olusegun Michael Otunuga

USF Tampa Graduate Theses and Dissertations

Supply and demand in the World oil market are balanced through responses to price movement with considerable complexity in the evolution of underlying supply-demand

expectation process. In order to be able to understand the price balancing process, it is important to know the economic forces and the behavior of energy commodity spot price processes. The relationship between the different energy sources and its utility together with uncertainty also play a role in many important energy issues.

The qualitative and quantitative behavior of energy commodities in which the trend in price of one commodity coincides with the trend in price of …

Topological Data Analysis Of Properties Of Four-Regular Rigid Vertex Graphs, Grant Mcneil Conine

USF Tampa Graduate Theses and Dissertations

Homologous DNA recombination and rearrangement has been modeled with a class of four-regular rigid vertex graphs called assembly graphs which can also be represented by double occurrence words. Various invariants have been suggested for these graphs, some based on the structure of the graphs, and some biologically motivated.

In this thesis we use a novel method of data analysis based on a technique known as partial-clustering analysis and an algorithm known as Mapper to examine the relationships between these invariants. We introduce some of the basic machinery of topological data analysis, including the construction of simplicial complexes on a data …

A Maximum Principle In The Engel Group, James Klinedinst

USF Tampa Graduate Theses and Dissertations

In this thesis, we will examine the properties of subelliptic jets in the Engel group of step 3. Step-2 groups, such as the Heisenberg group, do not provide insight into the general abstract calculations. This thesis then, is the first explicit non-trivial computation of the abstract results.

On The Classification Of Groups Generated By Automata With 4 States Over A 2-Letter Alphabet, Louis Caponi

USF Tampa Graduate Theses and Dissertations

The class of groups generated by automata have been a source of many counterexamples in group theory. At the same time it is connected to other branches of mathematics, such as analysis, holomorphic dynamics, combinatorics, etc. A question that naturally arises is finding the ways to classify these groups. The task of a complete classification and understanding at the moment seems to be too ambitious, but it is reasonable to concentrate on some smaller subclasses of this class. One approach is to consider groups generated by small automata: the automata with k states over d-letter alphabet (so called, (k,d)-automata) with …

Properties Of Graphs Used To Model Dna Recombination, Ryan Arredondo

USF Tampa Graduate Theses and Dissertations

A model for DNA recombination uses 4-valent rigid vertex graphs,

called assembly graphs. An assembly graph,

similarly to the projection of knots, can be associated with an

unsigned Gauss code, or double occurrence word.

We define biologically motivated reductions that act on double

occurrence words and, in turn, on their associated assembly graphs. For

every double occurrence word w there is a sequence of reduction

operations that may be applied to w so that what remains is the

empty word, [epsilon]. Then the nesting index of a word w,

denoted by NI(w), is defined to to be …