# Browse Dissertations and Theses - Mathematics by Title

• (1991)
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties of these 1-factorizations are of interest; to study them, we develop results about the automorphism group of tensor products ...

application/pdf

PDF (3MB)
• (1991)
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties of these 1-factorizations are of interest; to study them, we develop results about the automorphism group of tensor products ...

application/pdf

PDF (3MB)
• (1998)
We focus on the A° sets and show that abstract complexity theory can be applied to the degrees of unsolvability simply by relativizing the notion of a complexity measure to 0'. Since the Gap Theorem holds in our context, ...

application/pdf

PDF (8MB)
• (1964)

application/pdf

PDF (758kB)
• (1963)

application/pdf

PDF (2MB)
• (1958)

application/pdf

PDF (2MB)
• (1964)

application/pdf

PDF (857kB)
• (1964)

application/pdf

PDF (1MB)
• (1969)

application/pdf

PDF (2MB)
• (1999)
For a commutative algebra A, the algebraic K-theory of A, K*(A), and the Hochschild homology of A, HH*(A), are graded rings, and the Dennis trace map D : K *(A) → HH*( A) is a graded ring map. Since Hochschild homology ...

application/pdf

PDF (2MB)
• (1972)

application/pdf

PDF (2MB)
• (2003)
In this work we are concerned with algebraic curves over supersimple fields. First it is proved that an elliptic curve defined over a supersimple field K whose j-invariant is s-generic over empty has a rational point ...

application/pdf

PDF (4MB)
• (1973)

application/pdf

PDF (2MB)
• (1976)

application/pdf

PDF (2MB)
• (2006)
In this thesis, we are primarily concerned with an algorithm, due to Kohn, for finding subelliptic multipliers in the theory of several complex variables. Kohn's work applies to rings of germs of smooth functions. A special ...

application/pdf

PDF (1MB)
• (1996)
The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear ...

application/pdf

PDF (3MB)
• (2011-05-25)
A filling subgroup of a finitely generated free group F(X) is a subgroup which does not fix a point in any very small action free action on an R-tree. For the free group of rank two, we construct a combinatorial algorithm ...

application/pdf

PDF (2MB)
• (2007)
Above all, our work presents very explicit results, mostly stated as formulae and explicit representations, rather than algorithms. The formulae that we obtained for the ramifications and an integral basis of a cyclic ...

application/pdf

PDF (3MB)
• (1970)

application/pdf

PDF (3MB)
• (1963)

application/pdf

PDF (1MB)