On the number of equivalence classes of invertible Boolean functions under action of permutation of variables on domain and range
arXiv:1603.04386v28 citations
Originality Synthesis-oriented
AI Analysis
This work provides incremental progress in combinatorics and Boolean function theory, addressing a specific counting problem for researchers in discrete mathematics.
The paper tackled the problem of counting equivalence classes of invertible Boolean functions under permutations of variables, extending known results from n ≤ 6 to n ≤ 30 by calculating the values V_n.
Let $V_n$ be the number of equivalence classes of invertible maps from $\{0,1\}^n$ to $\{0,1\}^n$, under action of permutation of variables on domain and range. So far, the values $V_n$ have been known for $n\le 6$. This paper describes the procedure by which the values of $V_n$ are calculated for $n\le 30$.