Search Results for ""

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...

The study of the implications of chaos for a system in the semiclassical (i.e., between classical and quantum mechanical) regime. In quantum chaos, trajectories do not ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

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 ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

Let I be the incenter of a triangle DeltaABC and U, V, and W be the intersections of the segments IA, IB, IC with the incircle. Also let the centroid G lie inside the ...

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

Given a group action G×F->F and a principal bundle pi:A->M, the associated fiber bundle on M is pi^~:A×F/G->M. (1) In particular, it is the quotient space A×F/G where ...

Given a principal bundle pi:A->M, with fiber a Lie group G and base manifold M, and a group representation of G, say phi:G×V->V, then the associated vector bundle is ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...