![]() | This page is currently being merged. After a discussion, consensus to merge this page with Algebraic normal form was found. You can help implement the merge by following the instructions at Help:Merging and the resolution on the discussion. Process started in April 2025. |
Zhegalkin (also Žegalkin, Gégalkine or Shegalkin[1]) polynomials (Russian: полиномы Жегалкина), also known as algebraic normal form, are a representation of functions in Boolean algebra. Introduced by the Russian mathematician Ivan Ivanovich Zhegalkin in 1927,[2] they are the polynomial ring over the integers modulo 2. The resulting degeneracies of modular arithmetic result in Zhegalkin polynomials being simpler than ordinary polynomials, requiring neither coefficients nor exponents. Coefficients are redundant because 1 is the only nonzero coefficient. Exponents are redundant because in arithmetic mod 2, x2 = x. Hence a polynomial such as 3x2y5z is congruent to, and can therefore be rewritten as, xyz.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search