We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS, [1, 4, 10].In this paper, we prove that a function defined over finite sets with different number of elements can be represented as a polynomial function over a finite field. Given the data of a function… (More)
For any 4-regular graph G (possibly with multiple edges), we prove that, if the number N of distinct Euler orientations of G is such that N ≡ 1 (mod 3), then G has a 3-regular subgraph. It gives the new 4-regular graphs with multiple edges which have no 3-regular subgraphs, for which we know the number of Euler orientations.
—New families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks are proposed. The families are based in the three dimensional periodic Welch Costas array over elementary Abelian groups. These new families are shown to be asymptotically optimal through the Johnson bound.