Search Results for ""

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 type of error-correcting code that is related to Hadamard matrices.

The reflexive closure of a binary relation R on a set X is the minimal reflexive relation R^' on X that contains R. Thus aR^'a for every element a of X and aR^'b for distinct ...

The reflexive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same reflexive closure as R. Thus aR^'b for any elements a and b of X, ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon. If each point of intersection is associated with a node and diagonals are split ar each ...

A relation is any subset of a Cartesian product. For instance, a subset of A×B, called a "binary relation from A to B," is a collection of ordered pairs (a,b) with first ...

A relational system is a structure R=(S,{P_i:i in I},{f_j:j in J}) consisting of a set S, a collection of relations P_i(i in I) on S, and a collection of functions f_j(j in ...

Rényi entropy is defined as: H_alpha(p_1,p_2,...,p_n)=1/(1-alpha)ln(sum_(i=1)^np_i^alpha), where alpha>0, alpha!=1. As alpha->1, H_alpha(p_1,p_2,...,p_n) converges to ...

A method for predicting the onset of widespread chaos.