# Search

Now showing items 21-30 of 59

### On O-Basis Groups and Generalizations

(2008-09-09)

A class of finite groups which we call o-basis groups is generalized and explored. One
reason for interest in these groups lies with the concept's origins. The notion of o-basis
group arose from the study of the existence, ...

### Solving the Inverse Kinematic Robotics Problem: A Comparison Study of the Denavit-Hartenberg Matrix and Groebner Basis Theory

(2008-09-09)

The aim is to analyze two very di®erent methods for solving the inverse kinematic
robotics problem. The ¯rst method, called the Engineering Approach, uses the Denavit-
Hartenberg Matrix, and the second method, called the ...

### k-star Decompositions of Lambda-Fold Complete Multipartite Graphs

(2008-09-09)

We examine the problem of k-star decompositions on lambda-fold complete multipartite
graphs. After a brief examination of the computational complexity issues involved, we
present complete proofs for necessary and sufficient ...

### Constructing Cubic Splines on the Sphere

(2009-07-15)

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

(2009-07-15)

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

(2009-07-06)

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

(2009-04-15)

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.

(2009-07-28)

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

(2009-07-31)

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

(2009-08-03)

We discuss the chromatic number of the plane problem. We provide a detailed history
of its origins, along with some of the recent progress.