This Is AuburnElectronic Theses and Dissertations
  1. AUETD Home
  2. Browsing Auburn Theses and Dissertations by Author

Browsing Auburn Theses and Dissertations by Author "Jenda, Overtoun"

Now showing items 1-8 of 8

Atomic Characterization of L_1 And The Lorentz-Bochner Space L^X(p,1) for With Some Applications 

Kermausuor, Seth Kwame (2016-12-09)
In the 1950s, G. G Lorentz introduced the spaces $\Lambda(\alpha)$ and $M(\alpha)$, for $0<\alpha<1$ and showed that the dual of $\Lambda(\alpha)$ is equivalent to $M(\alpha)$ in his paper titled 'Some New Functional ...

Mixed Groups with Decomposition Bases and Global k-Groups 

Mathews, Chad (2006-08-15)
This thesis is devoted to proving assertions made without proof by Paul Hill and Charles Megibben in their fundamental papers regarding knice subgroups and the Axiom 3 characterization of global Warfield groups. The main ...

On Frobenius numbers in three variables 

Trimm, Janet (2006-08-15)
Given a set of relatively prime positive integers $\{a_1,a_2,\ldots, a_n\}$, after some point all positive integers are representable as a linear combination of the set with nonnegative coefficients. Which integer is the ...

The Shields-Harary Number of Graphs 

Holliday, John (2004-05-15)
The Shields-Harary numbers are a class of graph paramaters that measure the robustness of a graph in terms of network vulnerability, with reference to a given cost function.

Solving the Inverse Kinematic Robotics Problem: A Comparison Study of the Denavit-Hartenberg Matrix and Groebner Basis Theory 

Kendricks, Kimberly (2007-08-15)
The aim is to analyze two very di®erent methods for solving the inverse kinematic robotics problem. The ¯rst method, called the Engineering Approach, uses the Denavit- Hartenberg Matrix, and the second method, called the ...

Some Necessary Conditions for List Colorability of Graphs and a Conjecture on Completing Partial Latin Squares 

Bobga, Benkam (2008-12-15)
Let C be an infinite set of symbols, F the collection of finite subsets of C. A function L is a list assignment to a graph G if L assigns to each vertex of G a finite subset of C. A proper L-coloring occurs when adjacent ...

Torsionless Modules and Minimal Generating Sets for Ideals of Integral Domains 

Brown, Wesley (2006-08-15)
This is a treatise of relationships between the number of elements necessary to generate the ideals of a domain and the torsionless modules of that domain. Three types of domains are identified according to natural ...

The Triangle Intersection Problem For Hexagon Triple Systems 

Pettis, Carl (2006-08-15)
The Triangle Intersection Problem for Hexagon Triple Systems Carl S. Pettis, Auburn University A hexagon triple is the graph and a hexagon triple system is an edge disjoint decomposition of ...