Triangle method for constructing Zhegalkin polynomial: connection with Pascal's triangle
| Autor: | I. Ya. Spectorsky, O. A. Galganov |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Correctness
Applied Mathematics Exclusive or Computer Science::Computational Geometry Pascal's triangle Theoretical Computer Science Connection (mathematics) Combinatorics symbols.namesake Computational Theory and Mathematics Artificial Intelligence Simple (abstract algebra) TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Zhegalkin polynomial symbols Boolean function Binomial coefficient ComputingMethodologies_COMPUTERGRAPHICS Mathematics |
| Zdroj: | System research and information technologies. :129-145 |
| ISSN: | 2308-8893 1681-6048 |
| DOI: | 10.20535/srit.2308-8893.2020.1.12 |
| Popis: | Introduced by Soviet scientist I. Zhegalkin in 1927, Zhegalkin polynomial is a way to represent a Boolean function as an exclusive or of conjunctions of variables. One of the known algorithms for constructing Zhegalkin polynomial is so called ‘triangle method’ proposed in 1985–1987 by Soviet mathematician V.P. Suprun. Applying of the triangle method mainly coincides with step-by-step constructing Pascal triangle rows using the equality Cn+1k+1 = Cnk + Cnk+1. Therefore, it would be natural to expect for the relation between the calculation of Zhegalkin polynomial by the triangle method and an arrangement of binomial coefficients in Pascal triangle. In this paper, the connection between the triangle method and constructing of Pascal triangle is studied. Besides that, a rather simple proof of the triangle method correctness is proposed. This proof is based on juxtaposition of the triangle method steps and a step-by-step construction of Pascal triangle. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|