Before revision:  We additionally demonstrate how to implement higher-order polynomials using sequential networks with only pair-wise synapses. Finally, we derive upper bounds and expected numbers of connections based on the sparsity of the underlying representation .
After revision:  We additionally demonstrate how to implement higher-order polynomials using sequential networks with only pair-wise multiplicative synapses, and provide expected numbers of connections based on the sparsity of the underlying representation .