Search Results for ""

Consider the local behavior of a map f:R^m->R^n by choosing a point x in R^m and an open neighborhood U subset R^m such that x in U. Now consider the set of all mappings ...

An n-cycle is a finite sequence of points Y_0, ..., Y_(n-1) such that, under a map G, Y_1 = G(Y_0) (1) Y_2 = G(Y_1) (2) Y_(n-1) = G(Y_(n-2)) (3) Y_0 = G(Y_(n-1)). (4) In ...

The two-dimensional map x_(n+1) = [x_n+nu(1+muy_n)+epsilonnumucos(2pix_n)] (mod 1) (1) y_(n+1) = e^(-Gamma)[y_n+epsiloncos(2pix_n)], (2) where mu=(1-e^(-Gamma))/Gamma (3) ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

Let X and Y be CW-complexes and let X_n (respectively Y_n) denote the n-skeleton of X (respectively Y). Then a continuous map f:X->Y is said to be cellular if it takes ...

A map F from R^n to R^n is area-preserving if m(F^(-1)(A))=m(A) for every subregion A of R^n, where m(A) is the n-dimensional measure of A. A linear transformation is ...

f(x)=1/x-|_1/x_| for x in [0,1], where |_x_| is the floor function. The natural invariant of the map is rho(y)=1/((1+y)ln2).

Consider an n-dimensional deterministic dynamical system x^_^.=f^_(x) and let S be an n-1-dimensional surface of section that is traverse to the flow, i.e., all trajectories ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...