# Browse Dissertations and Theses - Mathematics by Title

• (1997)
In (Da92) E.C. Dade announcing the first of what has to be a series of conjectures concerned with counting characters in the blocks of finite groups. Specifically, Dade's so-called Ordinary Conjecture asserts that if a ...

application/pdf

PDF (4MB)
• (1959)

application/pdf

PDF (4MB)
• (1980)
It is known that many decision problems are unsolvable in the class of all finitely presented groups. When the class of groups is restricted, problems previously unsolvable can become solvable. In this work we investigate ...

application/pdf

PDF (4MB)
• (1977)

application/pdf

PDF (2MB)
• (2002)
Given an (undecidable) elementary theory of a computability-theoretic structure, it is natural to ask how much of the theory is decidable. An AE-sentence is a sentence in prenex normal form with all universal quantifiers ...

application/pdf

PDF (3MB)
• (1967)

application/pdf

PDF (1MB)
• (1969)

application/pdf

PDF (1MB)
• (1973)

application/pdf

PDF (2MB)
• (1968)

application/pdf

PDF (2MB)
• (1954)

application/pdf

PDF (1MB)
• (1971)

application/pdf

PDF (986kB)
• (1992)
A theory T admits elimination of imaginaries (EI) if every definable equivalence relation $\sim$ is the kernel of a definable map f. (I.e., $\vec{x}\sim\vec{y}\Longleftrightarrow f(\vec{x})=f(\vec{y}).)$ This term was ...

application/pdf

PDF (5MB)
• (2014-05-30)
The Hilbert scheme of $n$ points in a smooth del Pezzo surface $S$ parameterizes zero-dimensional subschemes with length $n$ on $S$. We construct a flat family of deformations of Hilb$^n S$ which can be conceptually ...

application/pdf

PDF (406kB)
• (1999)
Having explicitly calculated universal deformations, the next logical question is whether we can calculate deformations with local restrictions. In fact, the ordinary deformation problem is representable, and we explain ...

application/pdf

PDF (3MB)
• (2012-09-18)
We examine several problems in extremal graph theory, emphasizing problems involving games on graphs. In Chapter 2, we study a variant of Ramsey theory, seeking Ramsey hosts with small maximum degree. We focus on finding ...

application/pdf

PDF (895kB)
• (1987)
Consider the second order non-linear differential operator ${\cal L}y$ = Ly + $\eta y\sp3$, where $\eta$ = $\pm$1 and L, the linear part of ${\cal L}$, is of the form Ly = $y\sp{\prime\prime}$ + $p(x)y\sp\prime$ + q(x)y. ...

application/pdf

PDF (2MB)
• (1977)

application/pdf

PDF (3MB)
• (2012-09-18)
For finite group presentations, the word problem is solvable if and only if the Dehn function is computable. Additionally, the bounded word problem is always solvable. For finitely generated decidable group presentations, ...

application/pdf

PDF (741kB)
• (2008)
Our final problem is one in graph representations. We develop a lemma on traces of hypergraphs, extending results of Balogh and Bollobas. We then use this lemma, along with probabilistic methods, to show that for every ...

application/pdf

PDF (1MB)
• (1960)

application/pdf

PDF (795kB)