Abstract
This paper consists of two independent, but related parts. In the first part we show how to use symbolic computation to derive explicit expressions for the first few moments of the number of implicants that a random Boolean function has, or equivalently the number of fixed-dimensional subcubes contained in a random subset of the n-dimensional cube. These explicit expressions suggest, but do not prove, that these random variables are always asymptotically normal. The second part presents a full, human-generated proof, of this asymptotic normality, first proved by Urszula Konieczna. Accompanied by Maple package SMCboole.txt, available from http://www.math.rutgers.edu/∼zeilberg/mamarim/mamarimhtml/subcubes.html.
Original language | English (US) |
---|---|
Pages (from-to) | 512-520 |
Number of pages | 9 |
Journal | Palestine Journal of Mathematics |
Volume | 12 |
Issue number | 3 |
State | Published - 2023 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Keywords
- Boolean function
- asymptotic normality
- central moment
- cumulant
- discrete unit cube
- enumeration
- expectation
- experimental mathematics
- linearity of expectation
- subcube
- variance