Search Results for ""
1051 - 1060 of 2903 for Minimum Total Dominating SetSearch Results
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 separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...
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 ...
Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...
An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...
A fast boat is overtaking a slower one when fog suddenly sets in. At this point, the boat being pursued changes course, but not speed, and proceeds straight in a new ...
...
View search results from all Wolfram sites (39588 matches)

