Search Results for ""

If an integrable quasiperiodic system is slightly perturbed so that it becomes nonintegrable, only a finite number of n-map cycles remain as a result of mode locking. One ...

Consider a convex pentagon and extend the sides to a pentagram. Externally to the pentagon, there are five triangles. Construct the five circumcircles. Each pair of adjacent ...

A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Any tangle obtained by additions and multiplications of rational tangles (Adams 1994).

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

Let (X,tau) be a topological space, and let p in X. Then the arc component of p is union {A subset= X:A is an arc and p in A}.

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.