Search Results for ""

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

The index associated to a metric tensor g on a smooth manifold M is a nonnegative integer I for which index(gx)=I for all x in M. Here, the notation index(gx) denotes the ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

A paradox in decision theory. Given two boxes, B1 which contains $1000 and B2 which contains either nothing or a million dollars, you may pick either B2 or both. However, at ...

The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...

Given a set of ordered quantities, a list of the fractions of values at or below each quantity is know as a plotting position. A quantile-quantile plot compares observed ...

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...