classification of all associative mono-n-ary algebras with 2 elements所有分类关联mono-n-ary代数2元素.pdfVIP

Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2009, Article ID 678987, 16 pages doi:10.1155/2009/678987 Research Article Classification of All Associative Mono-n-ary Algebras with 2 Elements Stephan Dominique Andres Department of Mathematics and Computer Science, Fern Universitat in Hagen, ¨ Lutzowstraße 125, 58084 Hagen, Germany ¨ Correspondence should be addressed to Stephan Dominique Andres, dominique.andres@fernuni-hagen.de Received 9 July 2009; Accepted 22 December 2009 Recommended by Robert Redfield We consider algebras with a single n-ary operation and a certain type of associativity. We prove that up to isomorphism there are exactly 5 of these associative mono-n-ary algebras with 2 elements for even n ≥ 2 and 6 for odd n ≥ 3. These algebras are described explicitly. It is shown that a similar result is impossible for algebras with at least 4 elements. An application concerning the assignment of a control bit to a string is given. Copyright q 2009 Stephan Dominique Andres. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction One of the most demanding tasks of combinatorics consists in counting finite algebraic structures with certain properties or even in classifying them up to isomorphism. Various types of structures can be enumerated by the number of their elements using the methods of Polya 1, 2. However, there are some very difficult combinatorial problems that have not ´ been solved until now. One of these problems is to determine the number of semigroup