Now showing items 1-10 of 14
The Intersection Problem for Latin Squares with Holes of Size 2 and 3
In this dissertation we give complete solutions for the intersection problem of latin squares with holes of size 2 and 3. For a pair of 2n x 2n latin squares with holes of size 2 to have k entries in common outside of ...
Discrete sets, free sequences and cardinal properties of topological spaces
We study the influence of discrete sets and free sequences on cardinal properties of topological spaces. We focus mainly on the minimum number of discrete sets needed to cover a space X (denoted by dis(X)) and on reflection ...
Enclosings of Small Cycle Systems
In 2003 Hurd and others considered the problem of enclosing a triple system TS(v; lambda) in a triple system TS(v + s; lambda + m), focusing on smallest possible enclosings. In the second chapter, their result is generalized ...
Constructing Cubic Splines on the Sphere
A method to approximate functions defined on a sphere using Tensor Product cubic B-splines is presented here. The method is based on decomposing the sphere into six identical patches obtained by radially projecting the ...
Choice numbers, Ohba numbers and Hall numbers of some complete k-partite graphs
The choice numbers of some complete k−partite graphs are found, after we resolved a dispute regarding the choice number of K(4, 2, . . . , 2) when k is odd. Estimates of the choice numbers and the Ohba numbers of K(m, ...
Robust Methods for Functional Data Analysis
Functional data consist of observed functions or curves at a finite subset of an interval. Each functional observation is a realization from a stochastic process. This thesis aims to develop suitable statistical methodologies ...
A Study of Regularity and Normality
This paper is a broad overview of the separation axioms, commonly known as the Hausdorff, Regular, and Normal axioms. After a review of basic definitions and lemmas, we proceed to certain examples and theorems dealing ...
Intersection problem for the class of Reed-Muller codes.
The intersection problem for Coding Theory can be stated as follows: given a family or class of families of codes, find the spectrum of intersection numbers. The general strategy to attack this kind of problem begins ...
Indecomposable and Chainable Continua
This thesis covers topics in continuum theory related to indecomposable continua and chainable continua. Theorems are presented to characterize indecomposable continua and then chainability is explored in its connection ...
The Chromatic Number of the Euclidean Plane
We discuss the chromatic number of the plane problem. We provide a detailed history of its origins, along with some of the recent progress.