Search Results for ""

Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthonormal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

A Julia set fractal obtained by iterating the function z_(n+1)=c(z_n-sgn(R[z_n])), where sgn(x) is the sign function and R[z] is the real part of z. The plot above sets ...

Bourque and Ligh (1992) conjectured that the least common multiple matrix on a GCD-closed set S is nonsingular. This conjecture was shown to be false by Haukkanen et al. ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

Doob (1996) defines a stochastic process as a family of random variables {x(t,-),t in J} from some probability space (S,S,P) into a state space (S^',S^'). Here, J is the ...

A half-space is that portion of an n-dimensional space obtained by removing that part lying on one side of an (n-1)-dimensional hyperplane. For example, half a Euclidean ...

An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...