# Browse by Subject "Mathematics"

• (2003)
Let R be a model of an o-minimal theory T. We define the "T-levels" 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 Tarry-Escott problem and some related diophantine systems over Z and over some quadratic fields. We give infinitely many solutions of the Tarry-Escott 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)
• (1967)

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)
• (1991)
A theoretical framework is proposed for multivariate quality control based on multivariate statistical analysis and information-theoretical measures. A flow chart is proposed to determine whether the process is in control ...

application/pdf

PDF (6MB)
• (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)
• (1990)
For positive $\alpha$, and for complex measures $\mu$ and $\nu$ on R$\sp{n}$, define $J\sp\alpha(\mu,\nu)=\int\int\vert x-y\vert\sp\alpha\ d\mu(x)d\bar \nu(y)$. Study of the energy integral $J\sp\alpha$ has its roots in ...

application/pdf

PDF (3MB)
• (1958)

application/pdf

PDF (2MB)
• (1953)

application/pdf

PDF (1MB)
• (1966)

application/pdf

PDF (2MB)
• (1976)

application/pdf

PDF (2MB)
• (2010-08-20)
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)
• (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)
• (1989)
This thesis studies several topics in theoretical computer science. First, the author shows that $5n-4$ is a tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.

application/pdf

PDF (6MB)
• (1989)
In this dissertation we investigate three topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The ...

application/pdf

PDF (5MB)
• (1990)
The distribution-independent model of concept learning from examples ("PAC-learning") due to Valiant is investigated. It has previously been shown that the existence of an Occam algorithm for a class of concepts is a ...

application/pdf

PDF (7MB)