Allen, Peter
(2007)
*Almost every 2-SAT function is unate.*
Israel Journal of Mathematics, 161 (1).
pp. 311-346.
ISSN 0021-2172

## Abstract

Bollob´as, Brightwell and Leader showed that there are at most 2^(n 2)+o(n2) 2-SAT functions on n variables, and conjectured that in fact the number of 2-SAT functions on n variables is 2^(n 2)+n(1 + o(1)). We prove their conjecture. As a corollary of this, we also find the expected number of satisfying assignments of a random 2-SAT function on n variables. We also find the next largest class of 2-SAT functions and show that if k = k(n) is any function with k(n) < n1/4 for all sufficiently large n, then the class of 2-SAT functions on n variables which cannot be made unate by removing 25k variables is smaller than 2(n 2)+n−kn for all sufficiently large n.

Item Type: | Article |
---|---|

Official URL: | http://www.springerlink.com/content/0021-2172/ |

Additional Information: | © 2007 Springer |

Divisions: | Mathematics |

Subjects: | Q Science > QA Mathematics |

Sets: | Departments > Mathematics |

Date Deposited: | 28 May 2012 15:10 |

Last Modified: | 20 Nov 2019 09:04 |

URI: | http://eprints.lse.ac.uk/id/eprint/44103 |

### Actions (login required)

View Item |