On the number of countable subdirect powers of unary algebras
Nik Ruskuc, Bill de Witt

TL;DR
This paper characterizes when finite unary algebras have only countably many countable subdirect powers, showing it occurs precisely when all operations are permutations or constants.
Contribution
It provides a complete characterization of unary algebras with countably many subdirect powers based on the nature of their operations.
Findings
Countably many subdirect powers occur only when all operations are permutations or constants.
The characterization is both necessary and sufficient.
The result clarifies the structure of unary algebras with limited subdirect powers.
Abstract
A finite unary algebra has only countably many countable subdirect powers if and only if every operation is either a permutation or a constant mapping.
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
TopicsAdvanced Algebra and Logic · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
