Independence algebras, basis algebras and the distributivity condition
arXiv:1804.03177
Abstract
Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra of finite rank satisfies the distributivity condition (a condition satisfied by all the previously known examples), it is a reduct of an independence algebra . Our first aim is to give an example of an independence algebra not satisfying the distributivity condition. Gould showed that if a stable basis algebra with the distributivity condition has finite rank, then so does the independence algebra of which it is a reduct, and in this case the endomorphism monoid End of is a left order in the endomorphism monoid End of . We complete the picture by determining when End is a right, and hence a two-sided, order in End. In fact (for rank at least 2), this happens precisely when every element of End can be written as where End, is the inverse of in a subgroup of End and and have the same kernel. This is equivalent to End being a special kind of left order in End known as straight.