Wavelets are functions that are useful for representing signals and approximating other functions. Wavelets sets are defined in terms of Fourier transforms of certain wavelet functions. In this paper, we provide an introduction to wavelets and wavelets sets, examine the preexisting literature on the subject, and investigate an algorithm for creating wavelet sets. This algorithm creates single wavelets, which can be used to create bases for L2(Rn) through dilation and translation. We investigate the convergence properties of the algorithm, and implement the algorithm in Matlab.

This thesis considers three related structures on finite sets and outstanding conjectures on two of them. Several new problems and conjectures are stated.A union-closed collection of sets is a collection of sets which contains the union of each pair of sets in the collection. A completely separating system of sets is a collection of sets in which for each pair of elements of the universal set, there exists a set in the collection which contains the first element but not the second, and another set which contains the second element but not the first. An antichain (Sperner Family) is a collection of distinct sets in which no set is a subset of another set in the collection. The size of an antichain is the number of sets in the collection. The volume of an antichain is the sum of the cardinalities of the sets in the collection. A flat antichain is an antichain in which the difference in cardinality between any two sets in the antichain is at most one.The two outstanding conjectures considered are:The union-closed sets conjecture - In any union-closed collection of non-empty sets there is an element of the universal set in at least half of the sets in the collection;The flat antichain conjecture - Given an antichain with size s and volume V, there is a flat antichain with the same size and volume.Union-closed collections are considered in two ways. Improvements are made to the previously known bounds concerning the minimum size of a counterexample to the union-closed sets conjecture. Results are derived on the minimum size of a union-closed collection generated by a given number of k-sets. An ordering on sets is described, called order R and it is conjectured that choosing a collection of m k-sets in order R will always minimise the size of the union-closed collection generated by m k-sets.Several variants on completely separating systems of sets are considered. A ++ / determination is made of the minimum size of such collections, subject to various constraints on the collections. In particular, for each n and k, exact values or bounds are determined for the minimum size of completely separating systems on a n-set in which each set has cardinality k.Antichains are considered in their relationship to completely separating systems and the flat antichain conjecture is shown to be true in certain cases.

Thesis (Ph.D.)--McMaster University, 2005. / Supervisor: N. Balakrishnan. Includes bibliographical references (p. 148-152).

Thesis (Ph. D.)--University of Hong Kong, 1987.

published_or_final_version / abstract / toc / Earth Sciences / Master / Master of Philosophy

published_or_final_version / abstract / toc / Mathematics / Doctoral / Doctor of Philosophy

published_or_final_version / Mathematics / Master / Master of Philosophy

No description available.

No description available.

Bibliography: leaves 172-177. / xii, 179 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis is concerned with obtaining new inequalities for a planar, convex set containing exactly 0, 1 or 2 lattice points in its interior. / Thesis (Ph.D.)--University of Adelaide, Dept. of Pure Mathematics, 1997