Fixes of permutations acting on monotone Boolean functions
Abstract
We present a few algorithms and methods to count fixes of permutations acting on monotone Boolean functions. Some of these methods was used by Pawelski P to compute the number of inequivalent monotone Boolean functions with 8 variables.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.