Search Results for ""

If for each positive integer h, the sequence {u_(n+h)-u_n} is uniformly distributed (mod 1), then the sequence {u_n} is uniformly distributed (mod 1) (Montgomery 2001).

Let a group G have a group presentation G=<x_1,...,x_n|r_j(x_1,...,x_n),j in J> so that G=F/R, where F is the free group with basis {x_1,...,x_n} and R is the normal subgroup ...

The system of partial differential equations del ^4u = E(v_(xy)^2-v_(xx)v_(yy)) (1) del ^4v = alpha+beta(u_(yy)v_(xx)+u_(xx)v_(yy)-2u_(xy)v_(xy)), (2) where del ^4 is the ...

The x-axis is the horizontal axis of a two-dimensional plot in Cartesian coordinates that is conventionally oriented to point to the right (left figure). In three dimensions, ...

The vertical axis of a two-dimensional plot in Cartesian coordinates. Physicists and astronomers sometimes call this axis the ordinate, although that term is more commonly ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...