Search Results for ""

The slicing of a three-dimensional object by a plane (or more general slice).

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...

A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.

A permutation which shifts all elements of a set by a fixed offset, with the elements shifted off the end inserted back at the beginning. For a set with elements a_0, a_1, ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

The n-cyclohedron, also known as the Bott-Taubes polytope, is defined as the compactification of the configuration space of n points on the circle. The cyclohedron can be ...

The catacaustic of one arch of a cycloid given parametrically as x = t-sint (1) y = 1-cost (2) is a complicated expression for an arbitrary radiant point. For the case of the ...

The evolute of the cycloid x(t) = a(t-sint) (1) y(t) = a(1-cost) (2) is given by x(t) = a(t+sint) (3) y(t) = a(cost-1). (4) As can be seen in the above figure, the evolute is ...

The involute of the cycloid x = a(t-sint) (1) y = a(1-cost) (2) is given by x_i = a(t+sint) (3) y_i = a(3+cost). (4) As can be seen in the above figure, the involute is ...