In this paper we consider the behavior of certain surfaces at
certain boundary points. The surfaces under consideration satisfy
a topological definition and are of 2-dimension in 3-dimensional
Euclidean space with the ...
In his book on abstract algebra, Nathan Jacobson
poses and solves the problem of finding the number of
ways of inserting parentheses in a string of given length
with binary operators. We continue the work of Jacobson
...
The thesis discusses stability of procedures based on linear
computing formulas for numerical integration of an ordinary first-order
differential equation. The theorems are proved: (1) If the
procedure is asymptotical ...
This thesis treats the problem of enumerating equivalence
classes of Euler paths of full graphs. A full graph
is a complete, unordered, graph with no loops or repeated
edges. Two Euler paths are equivalent if and only ...
An algorithm is described for determining the vertices
and supporting planes (or lines) of the convex hull
of a given set of N distinct points in 3-space. The
method involves determining a finite sequence of convex
h ...
Computational scheme, equivalence, and Turing machine are
defined. Some computational schemes are examined and shown to
be equivalent to the computational scheme of a Turing machine.
Properties of Mellin transforms are applied to the summation
of infinite series. A specific example of this application leads to the
establishment of certain properties of a generalization of Lerch's zeta
function.
N ...