Free skew Boolean intersection algebras and set partitions
Ganna Kudryavtseva

TL;DR
This paper characterizes the atoms of free skew Boolean intersection algebras via set partitions, explores their structure, and connects these findings to combinatorial numbers like Bell and Stirling numbers, including infinite cases.
Contribution
It provides a bijective correspondence between atoms and pointed partitions, and describes the algebraic structure and combinatorial properties of free skew Boolean intersection algebras.
Findings
Atoms correspond to pointed partitions of non-empty subsets.
Atoms decompose into joins consistent with partition containment.
Finite free algebras' structure relates to Bell and Stirling numbers.
Abstract
We show that atoms of the -generated free left-handed skew Boolean intersection algebra are in a bijective correspondence with pointed partitions of non-empty subsets of . Furthermore, under the canonical inclusion into the -generated free algebra, where , an atom of the -generated free algebra decomposes into an orthogonal join of atoms of the -generated free algebra in an agreement with the containment relation on the respective partitions. As a consequence of these results, we describe the structure of finite free left-handed skew Boolean intersection algebras and express several their combinatorial characteristics in terms of Bell numbers and Stirling numbers of the second kind. We also look at the infinite case. For countably many generators, our constructions lead to the `partition analogue' of the Cantor tree whose boundary is the `partition…
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 Combinatorial Mathematics · semigroups and automata theory
