Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 103-106). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1969. / Typescript. Vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1967. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (M.Sc. (Mathematics)) -- University of Limpopo, 2022 / Our discussion starts with the study of convergence and clustering of filters initiated in pointfree setting by Hong, and then characterize compact and almost compact frames in terms of these filters. We consider the strict extension and show that tQL is a zerodimensional compact frame, where Q denotes the set of filters in L. Furthermore, we study the notion of general filters introduced by Banaschewski and characterize compact frames and almost compact frames using them. For filter selections, we consider F−compact and strongly F−compact frames and show that lax retracts of strongly F−compact frames are also strongly F−compact. We study further the ideals Rs(L) and RK(L) of the ring of realvalued continuous functions on L, RL. We show that Rs(L) and RK(L) are improper ideals of RL if and only if L is compact. We consider also fixed ideals of RL and showthat L is compact if and only if every ideal of RL is fixed if and only if every maximalideal of RL is fixed. Of interest, we consider the class of isocompact locales, which is larger that the class of compact frames. We show that isocompactness is preserved by nearly perfect localic surjections. We study perfect compactifications and show that the Stone-Cˇech compactifications and Freudenthal compactifications of rim-compact frames are perfect. We close the discussion with a small section on Z−closed frames and show that a basically disconnected compact frame is Z−closed.

The amount of data that our digital society collects is unprecedented. This represents a valuable opportunity to improve our quality of life by gaining insights about complex problems related to neuroscience, medicine and biology among others. Topological methods, in combination with classical statistical ones, have proven to be a precious resource in understanding and visualizing data. Multidimensional persistence is a method in topological data analysis which allows a multi-parameter analysis of a dataset through an algebraic object called multidimensional persistence module. Multidimensional persistence modules are complicated and contain a lot of information about the input data. This thesis deals with the problem of algorithmically describing multidimensional persistence modules and extracting information that can be used in applications. The information we extract, through invariants, should not only be efficiently computable and informative but also robust to noise. In Paper A we describe in an explicit and algorithmic way multidimensional persistence modules. This is achieved by studying the multifiltration of simplicial complexes defining multidimensional persistence modules. In particular we identify the special structure underlying the modules of n-chains of such multifiltration and exploit it to write multidimensional persistence modules as the homology of a chain complex of free modules. Both the free modules and the homogeneous matrices in such chain complex can be directly read off the multifiltration of simplicial complexes. Paper B deals with identifying stable invariants for multidimensional persistence. We introduce an algebraic notion of noise and use it to compare multidimensional persistence modules. Such definition allows not only to specify the properties of a dataset we want to study but also what should be neglected. By disregarding noise the, so called, persistent features are identified. We also propose a stable discrete invariant which collects properties of persistent features in a multidimensional persistence module. / <p>QC 20150525</p>

No description available.

No description available.

No description available.

No description available.

No description available.