On the number of inequivalent monotone Boolean functions of 9 variables

2023/05/10 by Bartłomiej Pawelski, Pawelski, Bartłomiej · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.2305.06346

openalex publication_date 2023/05/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We provide the first-ever calculation of the number of inequivalent monotone Boolean functions of 9 variables, which is equal to 789,204,635,842,035,040,527,740,846,300,252,680.

Cited by

• Fundamental groups of small simplicial complexes

Related

• On the number of inequivalent monotone Boolean functions of 8 variables
• Counting inequivalent monotone Boolean functions
• Fixes of permutations acting on monotone Boolean functions
• Counting unate and balanced monotone Boolean functions
• Counting interval sizes in the poset of monotone Boolean functions