Representation of polynomially stable functions by sums of Boolean read-once functions over the elementary basis

The paper considers polynomially stable Boolean functions. Proved that Boolean read-once functions over the elementary basis of a certain kind are polynomially stable. The following is an algorithm for obtaining for any polynomial stable function its representation as a sum of such Boolean read-once functions.