Physical Sciences and Mathematics Commons^™

Identification Of Transcriptionally Quiescent Regions In The Neurospora Crassa Genome, Katie Marie Groskreutz

Theses and Dissertations

Sexual reproduction and genetic exchange via meiosis are important and highly conserved processes in many living organisms. Occasionally, complications occur during meiosis that can result in chromosome abnormalities. In humans, improper chromosome development can cause life altering disorders such as Down Syndrome, Edwards Syndrome, and Patau Syndrome. Unfortunately, despite its importance, gaps remain in our knowledge of how this process works. For instance, little is known about how homolog identification occurs and what proteins identify matching chromosomes during pairing. This fundamental process occurs early during meiosis and ensures proper development of gametes.

Understanding the proteins involved during homolog pairing may …

The Minimum Rank Of Schemes On Graphs, William Nelson Sexton

Theses and Dissertations

Let G be an undirected graph on n vertices and let S(G) be the class of all real-valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let V = {1, 2, . . . , n} be the vertex set of G. A scheme on G is a function f : V → {0, 1}. Given a scheme f on G, there is an associated class of matrices Sf (G) = {A ∈ S(G)|aii = 0 if and only if f(i) = 0}. A scheme f is said …

A Volume Bound For Montesinos Links, Kathleen Arvella Finlinson

Theses and Dissertations

The hyperbolic volume of a knot complement is a topological knot invariant. Futer, Kalfagianni, and Purcell have estimated the volumes of Montesinos link complements for Montesinos links with at least three positive tangles. Here we extend their results to all hyperbolic Montesinos links.

Representations Associated To The Group Matrix, Joseph Aaron Keller

Theses and Dissertations

For a finite group G = {g_0 = 1, g_1,. . ., g_{n-1}} , we can associate independent variables x_0, x_1, . . ., x_{n-1} where x_i = x_{g_i}. There is a natural action of Aut(G) on C[x_0, . . . ,x_{n-})]. Let C_1, . . . , C_r be the conjugacy classes of G. If C = {g_{i_1}, g_{i_2}, . . . , g_{i_u }} is a conjugacy class, then let x(C) = x_{i_1} + x_{i_2} + . . . + x_{i_u}. Let ρG be the representation of Aut(G) on C[x_0, . . . , x_(n-1)]/〈x(C_1), . . . …

Prospect Theory Preferences In Noncooperative Game Theory, Philip Leclerc

Theses and Dissertations

The present work seeks to incorporate a popular descriptive, empirically grounded model of human preference under risk, prospect theory, into the equilibrium theory of noncooperative games. Three primary, candidate definitions are systematically identified on the basis of classical characterizations of Nash Equilibrium; in addition, three equilibrium subtypes are defined for each primary definition, in order to enable modeling of players' reference points as exogenous and fixed, slowly and myopically adaptive, highly flexible and non-myopically adaptive. Each primary equilibrium concept was analyzed both theoretically and empirically; for the theoretical analyses, prospect theory, game theory, and computational complexity theory were all summoned …

Ramp Loss Svm With L1-Norm Regularizaion, Eric Hess

Theses and Dissertations

The Support Vector Machine (SVM) classification method has recently gained popularity due to the ease of implementing non-linear separating surfaces. SVM is an optimization problem with the two competing goals, minimizing misclassification on training data and maximizing a margin defined by the normal vector of a learned separating surface. We develop and implement new SVM models based on previously conceived SVM with L_1-Norm regularization with ramp loss error terms. The goal being a new SVM model that is both robust to outliers due to ramp loss, while also easy to implement in open source and off the shelf mathematical programming …

Turán Problems On Non-Uniform Hypergraphs, Jeremy Travis Johnston

Theses and Dissertations

A non-uniform hypergraph H = (V, E) consists of a vertex set V and an edge set E ⊆ 2 V; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be the maximum Lubell value of a graph G (in the limit) which is H-free and such that R(G) ⊆ R(H). The Lubell function, is the expected number of edges in G hit by a random …

Independence Polynomials, Gregory Matthew Ferrin

Theses and Dissertations

In this thesis, we investigate the independence polynomial of a simple graph G. In addition to giving several tools for computing these polynomials and giving closed-form representations of these polynomials for common classes of graphs, we prove two results concerning the roots of independence polynomials. The first result gives us the unique root of smallest modulus of the independence polynomial of a graph. The second result tells us that all the roots of the independence polynomial of a claw-free graph fall on the real line.