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
and go beyond it in that we no longer consider one binary
operator...
In this paper, we are concerned with the very general notion of
a universal algebra. A universal algebra essentially consists of a set
A together with a possibly infinite set of finitary operations on. A.
Generally, these operations are related by means of equations, yielding
different algebraic structures such as...
The problem of determining the estimability of linear parametric
functions in classification models is examined. The two estimability
problems which are specifically aimed at are: the problem of determining
whether the design matrix is of maximal rank (i. e. , all cell
expectations are estimable); and in the event that...