Search Results for ""

A cusp is a point at which two branches of a curve meet such that the tangents of each branch are equal. The above plot shows the semicubical parabola curve x^3-y^2=0, which ...

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

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

The symbol | most commonly used to denote the adjoint operator. The dagger is also known as the obelisk, obelus, or long cross (Bringhurst 1997, p. 275).

int_0^inftye^(-omegaT)cos(omegat)domega=T/(t^2+T^2), which can be computed using integration by parts.