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.

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.

This study revolves around operators defined by conditional expectations and operators generated by random measures. Studies of operators in function spaces defined by conditional expectations first appeared in the mid 1950's by S-T.C. Moy [22] and S. Sidak [26]. N. Kalton studied them in the setting of Lp-spaces 0 < p < 1 in [15, 131 and in L1-spaces, [14], while W. Arveson [5] studied them in L2-spaces. Their averaging properties were studied by P.G. Dodds and C.B. Huijsmans and B. de Pagter in [7] and C.B. Huijsmans and B. de Pagter in [lo]. A. Lambert [17] studied their relationship with multiplication operators in C*-modules. It was shown by J.J. Grobler and B. de Pagter [8] that partial integral operators that were studied A.S. Kalitvin et a1 in [2, 4, 3, 11, 121 and the special cases of kernel operators that were, inter alia, studied by A.R. Schep in [25] were special cases of conditional expectation operators. On the other hand, operators generated by random measures or pseudo-integral operators were studied by A. Sourour [28, 271 and L.W. Weis [29,30], building on the studies of W. Arveson [5] and N. Kalton [14, 151, in the late 1970's and early 1980's. In this thesis we extend the work of J.J. Grobler and B. de Pagter [8] on Multiplication Conditional Expectation-representable (MCE-representable) operators. We also generalize the result of A. Sourour [27] and show that order continuous linear maps between ideals of almost everywhere finite measurable functions on u-finite measure spaces are MCE-representable. This fact enables us to easily deduce that sums and compositions of MCE-representable operators are again MCE-representable operators. We also show that operators generated by random measures are MCE-representable. The first chapter gathers the definitions and introduces notions and concepts that are used throughout. In particular, we introduce Riesz spaces and operators therein, Riesz and Boolean homomorphisms, conditional expectation operators, kernel and absolute T-kernel operators. In Chapter 2 we look at MCE-operators where we give a definition different from that given by J.J. Grobler and B. de Pagter in [8], but which we show to be equivalent. Chapter 3 involves random measures and operators generated by random measures. We solve the problem (positively) that was posed by A. Sourour in [28] about the relationship of the lattice properties of operators generated by random measures and the lattice properties of their generating random measures. We show that the total variation of a random signed measure representing an order bounded operator T, it being the difference of two random measures, is again a random measure and represents ITI. We also show that the set of all operators generated by a random measure is a band in the Riesz space of all order bounded operators. In Chapter 4 we investigate the relationship between operators generated by random measures and MCE-representable operators. It was shown by A. Sourour in [28, 271 that every order bounded order continuous linear operator acting between ideals of almost everywhere measurable functions is generated by a random measure, provided that the measure spaces involved are standard measure spaces. We prove an analogue of this theorem for the general case where the underlying measure spaces are a-finite. We also, in this general setting, prove that every order continuous linear operator is MCE-representable. This rather surprising result enables us to easily show that sums, products and compositions of MCE-representable operator are again MCE-representable. Key words: Riesz spaces, conditional expectations, multiplication conditional expectation-representable operators, random measures. / Thesis (Ph.D. (Mathematics))--North-West University, Potchefstroom Campus, 2004.

This study revolves around operators defined by conditional expectations and operators generated by random measures. Studies of operators in function spaces defined by conditional expectations first appeared in the mid 1950's by S-T.C. Moy [22] and S. Sidak [26]. N. Kalton studied them in the setting of Lp-spaces 0 < p < 1 in [15, 131 and in L1-spaces, [14], while W. Arveson [5] studied them in L2-spaces. Their averaging properties were studied by P.G. Dodds and C.B. Huijsmans and B. de Pagter in [7] and C.B. Huijsmans and B. de Pagter in [lo]. A. Lambert [17] studied their relationship with multiplication operators in C*-modules. It was shown by J.J. Grobler and B. de Pagter [8] that partial integral operators that were studied A.S. Kalitvin et a1 in [2, 4, 3, 11, 121 and the special cases of kernel operators that were, inter alia, studied by A.R. Schep in [25] were special cases of conditional expectation operators. On the other hand, operators generated by random measures or pseudo-integral operators were studied by A. Sourour [28, 271 and L.W. Weis [29,30], building on the studies of W. Arveson [5] and N. Kalton [14, 151, in the late 1970's and early 1980's. In this thesis we extend the work of J.J. Grobler and B. de Pagter [8] on Multiplication Conditional Expectation-representable (MCE-representable) operators. We also generalize the result of A. Sourour [27] and show that order continuous linear maps between ideals of almost everywhere finite measurable functions on u-finite measure spaces are MCE-representable. This fact enables us to easily deduce that sums and compositions of MCE-representable operators are again MCE-representable operators. We also show that operators generated by random measures are MCE-representable. The first chapter gathers the definitions and introduces notions and concepts that are used throughout. In particular, we introduce Riesz spaces and operators therein, Riesz and Boolean homomorphisms, conditional expectation operators, kernel and absolute T-kernel operators. In Chapter 2 we look at MCE-operators where we give a definition different from that given by J.J. Grobler and B. de Pagter in [8], but which we show to be equivalent. Chapter 3 involves random measures and operators generated by random measures. We solve the problem (positively) that was posed by A. Sourour in [28] about the relationship of the lattice properties of operators generated by random measures and the lattice properties of their generating random measures. We show that the total variation of a random signed measure representing an order bounded operator T, it being the difference of two random measures, is again a random measure and represents ITI. We also show that the set of all operators generated by a random measure is a band in the Riesz space of all order bounded operators. In Chapter 4 we investigate the relationship between operators generated by random measures and MCE-representable operators. It was shown by A. Sourour in [28, 271 that every order bounded order continuous linear operator acting between ideals of almost everywhere measurable functions is generated by a random measure, provided that the measure spaces involved are standard measure spaces. We prove an analogue of this theorem for the general case where the underlying measure spaces are a-finite. We also, in this general setting, prove that every order continuous linear operator is MCE-representable. This rather surprising result enables us to easily show that sums, products and compositions of MCE-representable operator are again MCE-representable. Key words: Riesz spaces, conditional expectations, multiplication conditional expectation-representable operators, random measures. / Thesis (Ph.D. (Mathematics))--North-West University, Potchefstroom Campus, 2004.

This thesis contains four articles related to mathematical aspects of Density Functional Theory. In Paper A, the theoretical justification of density methods formulated with current densities is addressed. It is shown that the set of ground-states is determined by the ensemble-representable particle and paramagnetic current density. Furthermore, it is demonstrated that the Schrödinger equation with a magnetic field is not uniquely determined by its ground-state solution. Thus, a wavefunction may be the ground-state of two different Hamiltonians, where the Hamiltonians differ by more than a gauge transformation. This implies that the particle and paramagnetic current density do not determine the potentials of the system and, consequently, no Hohenberg-Kohn theorem exists for Current Density Functional Theory formulated with the paramagnetic current density. On the other hand, by instead using the particle density as data, we show that the scalar potential in the system's Hamiltonian is determined for a fixed magnetic field. This means that the Hohenberg-Kohn theorem continues to hold in the presence of a magnetic field, if the magnetic field has been fixed. Paper B deals with N-representable density functionals that also depend on the paramagnetic current density. Here the Levy-Lieb density functional is generalized to include the paramagnetic current density. It is shown that a wavefunction exists that minimizes the "free" Hamiltonian subject to the constraints that the particle and paramagnetic current density are held fixed. Furthermore, a convex and universal current density functional is introduced and shown to equal the convex envelope of the generalized Levy-Lieb density functional. Since this functional is convex, the problem of finding the particle and paramagnetic current density that minimize the energy is related to a set of Euler-Lagrange equations. In Paper C, an N-representable Kohn-Sham approach is developed that also include the paramagnetic current density. It is demonstrated that a wavefunction exists that minimizes the kinetic energy subject to the constraint that only determinant wavefunctions are considered, as well as that the particle and paramagnetic current density are held fixed. Using this result, it is then shown that the ground-state energy can be obtained by minimizing an energy functional over all determinant wavefunctions that have finite kinetic energy. Moreover, the minimum is achieved and this determinant wavefunction gives the ground-state particle and paramagnetic current density. Lastly, Paper D addresses the issue of a Hohenberg-Kohn variational principle for Current Density Functional Theory formulated with the total current density. Under the assumption that a Hohenberg-Kohn theorem exists formulated with the total current density, it is shown that the map from particle and total current density to the vector potential enters explicitly in the energy functional to be minimized. Thus, no variational principle as that of Hohenberg and Kohn exists for density methods formulated with the total current density. / <p>QC 20140523</p>

No description available.