Studies of Euler diagrams/farofe
This Boolean function has 12 of 16 true spots. It is similar to medusa, but without spot 3. (See here.)
symmetry edit
The Euler diagrams shown above are not good, because they hide the symmetry of this Boolean function.
This code is part of a Python library called discrete helpers, which is not yet published. from discretehelpers.boolf.examples import farofe
assert farofe.symmetric_spots.blocks_with_singletons() == [[0, 4], [1, 5], [2, 12], [6, 8], [7, 9], [10, 14]]
|
filtrates edit
Each of the 6 pairs is a 2-split (with all 4 quadrants). Only one of the 4 triples is a 3-split (with all 8 octants).
Euler diagram | |||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
graph | |||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
cells edit
blue and green (top) | ||
---|---|---|
either blue or green (middle) | ||
---|---|---|
neither blue nor green (bottom) | |
---|---|