Advisers: Luchezar L. Avramov and Srikanth B. Iyengar

]]>In Part I, we use complete (injective) resolutions to define a stable version of local cohomology. For a module having a complete injective resolution, we associate a stable local cohomology module; this gives a functor to the stable category of Gorenstein injective modules. We show that this functor behaves much like the usual local cohomology functor. When there is only one non-zero local cohomology module, we show there is a strong connection between that module and the stable local cohomology module; in fact, the latter gives a Gorenstein injective approximation of the former.

In Part II, we utilize minimal cotorsion-flat resolutions to compute cosupport. We first develop a criterion for a cotorsion-flat resolution to be minimal. For a module having an appropriately minimal resolution by cotorsion-flat modules, we show that its cosupport coincides with those primes ``appearing'' in such a resolution---much like the dual notion that minimal injective resolutions detect (small) support. This gives us a method to compute the cosupport of various modules, including all flat modules and all cotorsion modules.

Adviser: Mark E. Walker

]]>Adviser: Thomas Marley

]]>We establish basic mathematical properties of bias matrices, in particular describing the fundamental polytope in which all biases reside (Theorem 3.25). We show how the underlying simple digraph of a bias matrix, which we term the bias network, serves as a combinatorial generalization of neuronal templates. Surprisingly, every simple digraph is realizable as the bias network of some sequence (Theorem 3.34). The bias-matrix representation leads us to a natural method for sequence correlation, which then leads to a probabilistic framework for determining the similarity of one set of sequences to another. Using data from rat hippocampus, we describe events of interest and also sequence-detection techniques. Finally, the bias matrix and the similarity measure are applied to this real-world data using code developed by us.

Advisor: Vladimir Itskov

]]>Adviser: Mark Brittenham and Susan Hermiller

]]>Adviser: Mark Brittenham

]]>Advisers: Petronela Radu and Daniel Toundykov

]]>The *degree sequence* of a (hyper)graph is the list of the number of edges containing each vertex. A *t-switch* replaces* t* edges with* t* new edges while maintaining the same degree sequence. For graphs, it has been repeatedly shown that any realization of a degree sequence can be turned into any other realization by a sequence of 2-switches. However, Gabelman provided an example to show 2-switches are not sufficient for *k*-graphs with *k* ≥ 3. We classify all pairs of 3-graphs that do not admit a 2-switch but differ by a 3-switch. We use this to provide support that 2-switches and a 3-switch are sufficient for 3-graphs.

Given graphs *G* and *H*, *G* is *H-saturated* if *G* does not contain *H* as a subgraph, but *H* is a subgraph of *G+e* for any *e* not in *E*(*G*). While this is well defined for subgraphs, the similar definition is not well defined for induced subgraphs. To avoid this, Martin and Smith defined the* induced-saturation number* using trigraphs. We show that the induced-saturation number of stars is zero. This implies the existence of graphs that are star induced-saturated. We introduce the parameter indsat*(*n,H*) which is the minimum number of edges in an *H*-induced-saturated graph, when one exists. We provide bounds for indsat*(*n,K*_{1,3}) and compute it exactly for infinitely many *n*.

Adviser: Stephen Hartke

]]>Advisers: Mark Brittenham and Susan Hermiller

]]>Advisers: Bo Deng and Etsuko Moriyama

]]>1) Polynomial growth of Betti sequences over local rings (Chapter 2),

2) Connected sums of Gorenstein rings (Chapter 3).

Chapter 1 gives an introduction for the two topics discussed in this thesis.

The first part of the thesis deals with modules over complete intersections using free resolutions. The asymptotic patterns of the Betti sequences of the finitely generated modules over a local ring ** R** reflect and affect the singularity of

The second part of the thesis studies a construction on the set of Gorenstein local rings, known as their connected sum. Given a Gorenstein ring, one would like to know whether it can be decomposed as a connected sum and if so, what are its components. We give a concrete description in the case of Gorenstein Artin local algebra over a field. We further investigate conditions on the decomposability of some classes of Gorenstein Artin rings. This is joint work with Hariharan and Celikbas.

Adviser: Luchezar Avramov

]]>We first observe in the preliminaries chapter that for graphs with a fixed number of vertices and edges there is a threshold graph attaining the minimum number of matchings. The first two major results develop this fact in two different directions. In Chapter 3 we consider the problem of maximizing the number of matchings in the class of threshold graphs. We solve the problem completely, concluding that a graph in this class has the maximum number of matchings if and only if it is almost alternating. The second and more fundamental question is the problem of which threshold graph, and hence which graph, has the minimum number of matchings. Ahlswede and Katona determined which graph has the fewest matchings of size 2. In Chapter 4 we extend this result to all sizes of matchings and to the total number of matchings. We prove that either the lex graph or the colex graph minimizes the number of matchings. We further prove that the lex bipartite graph has the fewest matchings among all bipartite graphs with parts of fixed sizes.

Finally, in Chapter 5, we answer an extremal question about independent sets in hypergraphs. ... The final chapter discusses results about maximizing *s*-independent sets in *r*-uniform hypergraphs, the most significant result finds the 3-uniform hypergraph maximizing the number of 2-independent sets for certain numbers of vertices and edges.

Adviser: Jamie Radcliffe

]]>Adviser: David Pitts

]]>Adviser: Carina Curto

]]>∇_{a}^{ν}(p∇y)(t)+q(t)y(ρ(t)) = f(t),

where 0 < ν < 1.We begin with an introduction to the nabla fractional calculus. In the second chapter, we show existence and uniqueness of the solution to a fractional self-adjoint initial value problem. We find a variation of constants formula for this fractional initial value problem, and use the variation of constants formula to derive the Green's function for a related boundary value problem. We study the Green's function and its properties in several settings. For a simplified boundary value problem, we show that the Green's function is nonnegative and we find its maximum and the maximum of its integral. For a boundary value problem with generalized boundary conditions, we find the Green's function and show that it is a generalization of the first Green's function. In the third chapter, we use the Contraction Mapping Theorem to prove existence and uniqueness of a positive solution to a forced self-adjoint fractional difference equation with a finite limit. We explore modifications to the forcing term and modifications to the space of functions in which the solution exists, and we provide examples to demonstrate the use of these theorems.

Advisers: Lynn Erbe and Allan Peterson

]]>Adviser: Mark E. Walker

]]>Information storage devices are prone to errors over time, and the frequency of such errors increases as the storage medium degrades. Flash memory storage technology has become ubiquitous in devices that require high-density storage. In this work we discuss two methods of coding that can be used to address the eventual degradation of the memory. The first method is rewriting codes, a generalization of codes for write-once memory (WOM), which can be used to prolong the lifetime of the memory. We present constructions of binary and ternary rewriting codes using the structure of finite Euclidean geometries. We also develop strategies for reusing binary WOM codes on multi-level cells, and we prove results on the performance of these strategies.

The second method to address errors in memory storage is to use error-correcting codes. We present an LDPC code implementation method that is inspired by bit-error patterns in flash memory. Using this and the binary image mapping for nonbinary codes, we design structured nonbinary LDPC codes for storage. We obtain performance results by analyzing the probability of decoding error and by using the graph-based structure of the codes.

Adviser: Christine A. Kelley

]]>Adviser: Stephen G. Hartke

]]>