Search Results for ""

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

A function that arises in performance analysis of partially coherent, differentially coherent, and noncoherent communications. The generalized Marcum Q-function is defined by ...

The largest value of a set, function, etc. The maximum value of a set of elements A={a_i}_(i=1)^N is denoted maxA or max_(i)a_i, and is equal to the last element of a sorted ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...

The term "cylinder" has a number of related meanings. In its most general usage, the word "cylinder" refers to a solid bounded by a closed generalized cylinder (a.k.a. ...

In general, "a" calculus is an abstract theory developed in a purely formal way. "The" calculus, more properly called analysis (or real analysis or, in older literature, ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

The inequality sinAsinBsinC<=((3sqrt(3))/(2pi))^3ABC, where A, B, and C are the vertex angles of a triangle. The maximum is reached for an equilateral triangle (and therefore ...