# Browse Dissertations and Theses - Mathematics by Title

• (1961)

application/pdf

PDF (2Mb)
• (1972)

application/pdf

PDF (2Mb)
• (2012-09-18)
This dissertation is divided into three main sections. The main result of Section 1 is that, for $a,b>1$, irrational, the quantity $\log (a/b)$ is not too far'' from the series of fractional parts $$\sum_{n=1}^{\i ... application/pdf PDF (1Mb) • (2010-05-14) This dissertation involves two topics. The first is on the theory of partitions, which is discussed in Chapters 2 − 5. The second is on covering systems, which are considered in Chapters 6 − 8. In 2000, Farkas and Kra ... application/pdf PDF (942Kb) • (1982) This thesis considers the notions of decomposable operators in the sense of C. Foias, and a certain analytic condition--called condition ((beta))--due to Errett Bishop. It is shown that the concepts are related, and that ... application/pdf PDF (2Mb) • (1978) application/pdf PDF (5Mb) • (1989) We use R. Knorr's theory of virtually irreducible lattices to study the blocks of a finite group. application/pdf PDF (2Mb) • (1971) application/pdf PDF (2Mb) • (1989) In this paper the Boolean valued method is used to develop a theory closely resembling the theory of probabilistic metric spaces. In this development the complete Boolean algebra used must have the form of the quotient ... application/pdf PDF (3Mb) • (1975) application/pdf PDF (4Mb) • (1969) application/pdf PDF (3Mb) • (1958) application/pdf PDF (2Mb) • (1981) We study binary error-correcting and error-detecting codes suitable for use on a completely asymmetric or Z channel. This channel accepts inputs of 0 and 1 and reproduces these faithfully as outputs, except that occasionally ... application/pdf PDF (3Mb) • (1969) application/pdf PDF (3Mb) • (1989) A family of polytopes in E\sp{d} is called nearly neighborly if, for every two members of the family, there is a hyperplane which separates them and contains a facet of each. Such a family is called neighborly if every ... application/pdf PDF (4Mb) • (1982) The Renyi redundancy, R(,s)(p,w), is the difference between the exponentially weighted average codeword length, application/pdf PDF (2Mb) • (1994) Suppose X is a submartingale that is continuous on the right with limits from the left and H is a predictable process bounded by 1 in absolute value. Let Y = (Y\sb{t})\sb{t\ge 0} where$$Y\sb{t} = H\sb0X\sb0 + ...

application/pdf

PDF (2Mb)
• (1988)
Let F be a finite extension of $\doubq\sb{p}$. Let L/F be a normal, totally ramified extension of degree $p\sp{2n}$ with ${\cal B}$ the maximal ideal of ${\cal D}\sb{\rm L}$. Suppose the Hilbert sequence for L/F has a ...

application/pdf

PDF (1Mb)
• (1973)

application/pdf

PDF (2Mb)
• (1993)
We establish the decomposition by the Arnold cat map of a uniform lattice of prime$\sp2$ sites into periodic orbits. We give a first integral (constant of motion) of this dynamical system and use it to find additional ...

application/pdf

PDF (1Mb)