Eulerian numbers weigths in distributed computing nets

Abstract

We explore the possibilities of Eulerian numbers to define weights in layered networks and model distributed computation at the level of neurons receptive fields. These networks are then compared to those defined by binomial coefficients (Newton filters). Their potential as structures for signals convergence, divergence and overlapping is also established.