 IDEALS Home
 →
 College of Liberal Arts and Sciences
 →
 Dept. of Mathematics
 →
 Dissertations and Theses  Mathematics
 →
 Browse Dissertations and Theses  Mathematics by Title
Browse Dissertations and Theses  Mathematics by Title
Now showing items 10021021 of 1084

(2003)Let R be a model of an ominimal theory T. We define the "Tlevels" of R and explore their connection to tame substructures of R , subject to a few easily satisfied assumptions. This leads to results about the ...
application/pdf
PDF (6MB) 
(2009)In this dissertation, we study the TarryEscott problem and some related diophantine systems over Z and over some quadratic fields. We give infinitely many solutions of the TarryEscott problem over Zi of degrees 2, ...
application/pdf
PDF (1MB) 
(1999)S. Ramanujan's last letter to G. H. Hardy contains the definition of mock theta functions, a list of 17 mock theta functions, and 5 identities related to mock theta functions. Also, Ramanujan's lost notebook contains many ...
application/pdf
PDF (6MB) 
(2001)In Chapter 6, we have discuss matricially holomorphic mappings between two TROs. We show that the Mobius transformation is matricially holomorphic.
application/pdf
PDF (4MB) 
application/pdf
PDF (2MB) 
(1998)On page 54, Ramanujan recorded certain summations of theta functions, which may be called the "circular summations of theta functions." In Chapter 7, we discuss these identities with elementary proofs.
application/pdf
PDF (3MB) 
(1992)We consider three separate topics in nonlinear optimization, one theoretical topic and two algorithmic topics. Each of these topics deals with a broad class of nonlinear optimization problems. We first introduce and analyze ...
application/pdf
PDF (4MB) 
application/pdf
PDF (2MB) 
application/pdf
PDF (1MB) 
application/pdf
PDF (2MB) 
(1976)
application/pdf
PDF (2MB) 
(20100820)Proving the existence or nonexistence of structures with specified properties is the impetus for many classical results in discrete mathematics. In this thesis we take this approach to three different structural questions ...
application/pdf
PDF (924kB) 
(2009)In the second chapter we study the Multiplicative Partition Function. In the third chapter we study an analog of the abc conjecture for arithmetical functions in r variables over a field K of characteristic zero.
application/pdf
PDF (1MB) 
(2000)In the last chapter we consider the problem of determining how large an integer M should be so that almost every subset of {l, ..., N} of size M contains at least one arithmetic progression of length k. We also investigate ...
application/pdf
PDF (4MB) 
(1986)In chapter 1 we investigate the A(,s)(n,d) problem in the Plotkin Region. The problem is to finding the maximum number of codewords in a code on an alphabet with s symbols that has length n and minimum Hamming distance d. ...
application/pdf
PDF (5MB) 
(1984)In this dissertation we present a number of new results in combinatorial number theory. Chapter I discusses a generalization of B(,2)sequences which are used in Chapter II and Chapter III to obtain short interval results ...
application/pdf
PDF (2MB) 
(1993)New results are proved on several problems in extremal graph theory.
application/pdf
PDF (4MB) 
(1959)
application/pdf
PDF (4MB) 
(1953)
application/pdf
PDF (2MB) 
application/pdf
PDF (2MB)
Now showing items 10021021 of 1084