Record Details
The enumeration of strings of a given length in an n-ary non-associative non-commutative algebra
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | The enumeration of strings of a given length in an n-ary non-associative non-commutative algebra |
| Names |
Klosinski, Leonard Frank
(creator) Goheen, Harry (advisor) |
| Date Issued | 1963-05-02 (iso8601) |
| Note | Graduation date: 1963 |
| Abstract | 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 but general n-ary operators chosen from a given set of p n-ary operators. Furthermore, the algebra we consider is neither associative nor commutative. We thus obtain a count of the number of strings of given length where the strings contain any of the given p n-ary operators. |
| Genre | Thesis/Dissertation |
| Topic | Algebra, Abstract |
| Identifier | http://hdl.handle.net/1957/49161 |
