On the maximal minimal cube lengths in distinct DNF tautologies
Combinatorics
2019-02-12 v1 Logic in Computer Science
Abstract
Inspired by a recent article by Anthony Zaleski and Doron Zeilberger, we investigate the question of determining the largest k for which there exists boolean formulas in disjunctive normal form (DNF) with n variables, none of whose conjunctions are `parallel', and such that all of them have at least k literals. Using a SAT solver, we answer some of the questions they left open. We also determine the corresponding numbers for DNFs obeying certain symmetries.
Cite
@article{arxiv.1902.03431,
title = {On the maximal minimal cube lengths in distinct DNF tautologies},
author = {Manuel Kauers and Martina Seidl and Doron Zeilberger},
journal= {arXiv preprint arXiv:1902.03431},
year = {2019}
}