On the minimal coset covering of solutions of a boolean equation (Բուլյան հավասարման լուծումների բազմության մինիմալ ծածկույթի մասին)

Համառոտագիր

For the equation x1x2 ... xn + xn+1xn+2 ... x2n + x2n+1x2n+2 ... x3n = 1 over the finite field F2 we estimate the minimal number of systems of linear equations over the same field such that the union of their solutions exactly coincides with the set of solutions of the equation. We prove in this article that the number in the question is not greater than 9n log2 3 +4.