No description available.

No description available.

This thesis describes properties of Abelian groups, and develops a study of the properties of divisibility in Abelian groups.

The context for the development of this work is constructive mathematics without the axiom of countable choice. By constructive mathematics, we mean mathematics done without the law of excluded middle. Our original goal was to give a list of axioms for the real numbers R by only considering the order on R. We instead develop a theory of ordered sets and their completions and a theory of ordered abelian groups. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

Thesis (M. Phil.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.

The study of combinatorial patterns of words has raised great interest since the early 20th century. In this master's thesis presentation we study two combinatorial patterns. The first pattern is “abelian k-th power free” and the second one is “representability of sets of words of equal length”. For the first pattern we study the context-freeness of non-abelian k-th powers. A word is a non-abelian k-th power if it cannot be factorized in the form w1w2...wk where the wi are permutations of w1 for 2 ≤ i ≤ k. We show that neither the language of non-abelian squares nor the language of non- abelian cubes is context-free. For the second pattern we study the representability of a set of words of fixed length. A set S of words of length n is representable if there exists some word w such that the set of length-n factors of w equals S. We will give lower and upper bounds for the number of such representable sets. Furthermore, we study a variation of the problem: we fix a length t, and try to evaluate the number of sets of words of length n such that there exists some word w of length t such that the set of length-n factors of w equals S. We give a closed-form formula in the case where n ≤ t < 2n. In particular, we give a characterization on two distinct words having the same subset of length-n factors.

Thesis (M. Sc.)--University of Canterbury, 2009. / Typescript (photocopy). Includes bibliographical references (p. 47-48). Also available via the World Wide Web.

Classical and quantum Chern-Simons with gauge group U(1)N were classified by Belov and Moore in [BM05]. They studied both ordinary topological quantum field theories as well as spin theories. On the other hand a correspondence is well known between ordinary (2 + 1)-dimensional TQFTs and modular tensor categories. We study group categories and extend them slightly to produce modular tensor categories that correspond to toral Chern-Simons. Group categories have been widely studied in other contexts in the literature [FK93],[Qui99],[JS93],[ENO05],[DGNO07]. The main result is a proof that the associated projective representation of the mapping class group is isomorphic to the one from toral Chern-Simons. We also remark on an algebraic theorem of Nikulin that is used in this paper. / text

The study of combinatorial patterns of words has raised great interest since the early 20th century. In this master's thesis presentation we study two combinatorial patterns. The first pattern is “abelian k-th power free” and the second one is “representability of sets of words of equal length”. For the first pattern we study the context-freeness of non-abelian k-th powers. A word is a non-abelian k-th power if it cannot be factorized in the form w1w2...wk where the wi are permutations of w1 for 2 ≤ i ≤ k. We show that neither the language of non-abelian squares nor the language of non- abelian cubes is context-free. For the second pattern we study the representability of a set of words of fixed length. A set S of words of length n is representable if there exists some word w such that the set of length-n factors of w equals S. We will give lower and upper bounds for the number of such representable sets. Furthermore, we study a variation of the problem: we fix a length t, and try to evaluate the number of sets of words of length n such that there exists some word w of length t such that the set of length-n factors of w equals S. We give a closed-form formula in the case where n ≤ t < 2n. In particular, we give a characterization on two distinct words having the same subset of length-n factors.

No description available.