# Browse Dissertations and Theses - Mathematics by Title

• (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) • (2003) Let A be an excellent local normal domain and fninfinity n=1 a sequence of prime elements lying in successively higher powers of the maximal ideal, such that each hypersurface A/ fnA satisfies R1. We establish the map ... application/pdf PDF (2MB) • (2006) This thesis is a study of the axiomatics of quantum vertex algebras based on the bicharacter construction suggested by R. Borcherds in [Bor01]. One of the goals is to use the ideas of [Bor01] to incorporate the examples ... application/pdf PDF (2MB) • (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) • (2015-12-10) We study the bound states of the 1+1 dimensional Dirac equation with a scalar potential, which can also be interpreted as a position dependent "mass'', analytically as well as numerically. We derive a Prüfer-like representation ... application/pdf PDF (1MB) • (1969) application/pdf PDF (3MB) • (1958) application/pdf PDF (2MB) • (2005) Moreover, in both cases above we give a characterization of dividing. 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)
• (2006)
We use the partial description of cohomology to reconstruct the tree T from a given four strand tree braid group B 4T up to homeomorphism. Thus tree braid groups B4T and trees T (up to homeomorphism) are in bijective ...

application/pdf

PDF (3MB)