# Browse by Subject "Mathematics"

• (1991)
Let $\lbrack n\rbrack = \{1,2,\..., n\},A$ and let $2\sp{\lbrack n\rbrack}$ represent the subset lattice of (n) with sets ordered by inclusion. A collection I of subsets of (n) is called an ideal if every subset of a member ...

application/pdf

PDF (3Mb)
• (1995)
The Banach envelope of $weakL\sp1$ (denoted $wL\sb{\1})$ is a sort of universal Banach space for separable Banach spaces. In this paper, we can see the complemented Banach subspaces of $wL\sb{\1}.$ In particular, the space ...

application/pdf

PDF (2Mb)
• (1971)

application/pdf

PDF (3Mb)
• (1966)

application/pdf

PDF (2Mb)
• (1990)
We derive upper and lower bounds on the computational complexity of prefix classes of several logical theories. The general method for obtaining lower bounds on the complexity of logical theories developed by Compton and ...

application/pdf

PDF (4Mb)
• (1990)
The relative power of several computational models is considered. These models are the Turing machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic ...

application/pdf

PDF (3Mb)
• (1960)

application/pdf

PDF (3Mb)
• (1955)

application/pdf

PDF (2Mb)
• (1961)

application/pdf

PDF (1Mb)
• (1968)

application/pdf

PDF (1Mb)
• (1968)

application/pdf

PDF (2Mb)
• (1974)

application/pdf

PDF (3Mb)
• (1974)

application/pdf

PDF (3Mb)
• (1954)

application/pdf

PDF (2Mb)
• (1966)

application/pdf

PDF (2Mb)
• (1970)

application/pdf

PDF (3Mb)
• (1995)
Various topics related to the work of Ramanujan are discussed in this thesis. In Chapter 2, we give a new proof of Ramanujan's famous partition identity modulo 5 (see (1.1)). This proof is an improvement of W. N. Bailey's ...

application/pdf

PDF (3Mb)
• (1977)

application/pdf

PDF (3Mb)
• (1953)

application/pdf

PDF (2Mb)
• (1984)
We consider the problem (DELTA)('2)(w(x,y)) = 0, w((+OR-)1,y) = w(,x)((+OR-)1,y) = 0 with boundary conditions w(,xx)(x,0) = f(x) w(,yy)(x,0) = g(x) on the semi-infinite strip -1 (LESSTHEQ) x (LESSTHEQ) 1, 0 < y.

application/pdf

PDF (3Mb)