The Largest Subsemilattices of the Endomorphism Monoid of an Independence Algebra
Jo\~ao Ara\'ujo, Wolfram Bentz, Janusz Konieczny

TL;DR
This paper characterizes the largest subsemilattices of the endomorphism monoid of finite-dimensional independence algebras, revealing their sizes depend on the presence of constant operations, with implications across various algebraic structures.
Contribution
It provides explicit formulas for the sizes of the largest subsemilattices in endomorphism monoids of independence algebras, extending to related algebraic structures.
Findings
Largest subsemilattice size is 2^{n-1} without constant operations.
Largest subsemilattice size is 2^n with constant operations.
Results apply to vector spaces, transformation monoids, and free G-sets.
Abstract
An algebra is said to be an independence algebra if it is a matroid algebra and every map , defined on a basis of , can be extended to an endomorphism of . These algebras are particularly well behaved generalizations of vector spaces, and hence they naturally appear in several branches of mathematics such as model theory, group theory, and semigroup theory. It is well known that matroid algebras have a well defined notion of dimension. Let be any independence algebra of finite dimension , with at least two elements. Denote by the monoid of endomorphisms of . We prove that a largest subsemilattice of has either elements (if the clone of does not contain any constant operations) or elements (if the clone of contains constant operations). As corollaries, we obtain formulas for the size of the largest…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Rings, Modules, and Algebras
