Gender of Boolean functions

Studies of Boolean functions
gender ratio for arities 0...5

A Boolean function shall be called male, iff its root is sharp (i.e. iff its compressed truth table has odd weight).
(Equivalently, it is female, iff after removing all repetitions, the weight of the truth table is still even.)

For positive arities, there are more males than females. The imbalance peaks for arity 2. For higher arities, the ratio is almost balanced.
The ratio is balanced for the infinite set of all Boolean functions. Both sets are countable, so there is a trivial bijection. But is there a meaningful bijection?

The number triangles in the following boxes show the numbers of Boolean functions by arity/adicity and valency.
Row indices on the left (🌊) are the arity, on the right (💧) the adicity. Entries on the left are the sums of columns on the right.
These triangles are based on Pascals triangle, with columns multiplied by consecutive entries of a sequence, which becomes the diagonal.








oddacity and gender

The XOR of all members of a family is either the tautology or the contradiction. Where it is the tautology, the BF shall be called oddacious.
There are no evenacious males. So every evenacious BF is female, and every male BF is oddacious.

See triangles by weight, e.g. male, oddacious.

The following images show 3-ary Boolean functions.   See also: Boolf prop/3-ary/oddacity & gender
The pattern of Zhegalkin indices for evenacious BF is similar to a Walsh matrix (with columns 3 and 7 exchanged). But that is specific to arity 3. So is the fact, that all non-trivial evenacious BF are balanced.