Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It's possible, that count of unique algebras (up to isomorphism) with one unary operation on set with $n$ elements is $2^n-1$?

For $n=1,2,3,4$ is this hypothesis true (I still have not verified it on the computer). Is there any counterexample, or idea for proof?


share|cite|improve this question
up vote 4 down vote accepted

In brief: no. There are 19 algebras on 4 elements, and the pattern breaks down after that.

Instead of algebras with one unary operation, we might as well speak of nonisomorphic functions on a set of $n$ elements. The answer is then given by Theorem 6 of "The Number of Structures of Finite Relations" by Davis, R.L. A pdf is available here.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.