# Browse Dissertations and Theses - Mathematics by Title

• (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)
• (1979)

application/pdf

PDF (2MB)
• (1997)
In their 1995 paper, Muller and Schupp define the concept of an alternating automaton, a sort of completion of the notion of a non-deterministic automaton, and show how the notion may be used to prove a number of major ...

application/pdf

PDF (11MB)
• (2004)
The Main Theorem shows that every nontrivial tame knot in R3 has an alternating quadrisecant. This result refines the previous work about quadrisecants and gives greater geometric insight into knots. The Main Theorem ...

application/pdf

PDF (3MB)
• (1984)
An (omega)-language is a set of infinite ((omega)-type) strings of symbols. We study the classes of (omega)-languages accepted by Turing Acceptors when infinite computations are allowed. There are various possible ...

application/pdf

PDF (2MB)
• (1997)
In 1877, R. Dedekind introduced the sum$$s(d, c) = \sum\sbsp{j=1}{c}\left(\left({j\over c}\right)\right)\left(\left({dj\over c}\right)\right),$$which appears in the multiplier system of the Dedekind eta-function as a modular ...

application/pdf

PDF (3MB)
• (1981)
Two algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are examined in order to account for the differences between the ideal and the machine-operator ...

application/pdf

PDF (5MB)
• (2011-08-26)
In this thesis, we provide connections between analytic properties in Euclidean R^n and analytic properties in sub-Riemannian Carnot groups. We introduce weak s-John domains, in analogy with weak John domains, and we prove ...

application/pdf

PDF (615kB)
• (2013-08-22)
In this paper we examine an approximation of the Maxwell-Boltzmann equation for a 1D gas. In the manner of classical gas dynamics, we derive a balance law and use it to determine the grossly determined solutions, a sub-class ...

application/pdf

PDF (436kB)
• (2004)
We prove error estimates for the case of both element-wise and patch-wise causal partitions.

application/pdf

PDF (5MB)
• (2004)
The focus of this dissertation is analysis of a causal spacetime discontinuous Galerkin (CSDG) method for one-dimensional hyperbolic systems of conservation laws. The CSDG method is based on causal spacetime discretizations, ...

application/pdf

PDF (3MB)
• (1990)
In 1983, Bhatia, Davis and McIntosh proved that if A and B are self-adjoint with dist($\sigma(A),\sigma(B)) \geq \delta$ then there is some $c\sb{sa} < 2$ (independent of A and B) such that $c\sb{sa}\vert\vert\vert AQ - ... application/pdf PDF (3MB) • (1950) application/pdf PDF (2MB) • (2013-05-24) We study vortex equations with a parameter$s$on smooth vector bundles$E$over compact K\"ahler manifolds$M$. For each$s\$, we invoke techniques in \cite{Br} by turning vortex equations into the elliptic partial ...

application/pdf

PDF (570kB)
• (2004)
Our work resolves many issues left untreated in the original paper by Lagarias and Odlyzko and makes several original contributions---some of which have applications in other areas. In this dissertation we: (1) introduce ...

application/pdf

PDF (8MB)
• (1987)
In this work we develop an approach of Selberg to the analytic continuation of Eisenstein series by means of Fredholm theory. We set up the machinery for very general algebraic groups and arithmetic subgroups, and obtain ...

application/pdf

PDF (5MB)