Search Results for ""

A mathematical relationship expressing f_n as some combination of f_i with i<n. When formulated as an equation to be solved, recurrence relations are known as recurrence ...

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

A knot diagram in which none of the crossings are reducible.

The system of partial differential equations E_t-v = 0 (1) r_x+omegav = 0 (2) q_x+Ev = 0 (3) v_x-omegar-Eq = 0. (4)

If a fixed point is added to each group of a special complete series, then the resulting series is complete.

A Reeb component is a Reeb foliation (M,F) whose leaves are proper. A foliation which has no Reeb components is said to be Reebless.

The Reeb foliation of the hypersphere S^3 is a foliation constructed as the union of two solid tori with common boundary.

A foliation which has no Reeb components is said to be Reebless.

A type of error-correcting code that is related to Hadamard matrices.