Search Results for ""

As shown by Schnirelman (1944), a square can be inscribed in any closed convex curve, although it is not known if this holds true for every Jordan curve (Steinhaus 1999, p. ...

Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...

Any nontrivial, closed, simple, smooth spherical curve dividing the surface of a sphere into two parts of equal areas has at least four inflection points.

The contraction of a tensor is obtained by setting unlike indices equal and summing according to the Einstein summation convention. Contraction reduces the tensor rank by 2. ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

The total power of a triangle is defined by P=1/2(a_1^2+a_2^2+a_3^2), (1) where a_i are the side lengths, and the "partial power" is defined by p_1=1/2(a_2^2+a_3^2-a_1^2). ...

Two polygons are congruent by dissection iff they have the same area. In particular, any polygon is congruent by dissection to a square of the same area. Laczkovich (1988) ...

The probability of getting at least one "6" in four rolls of a single 6-sided die is 1-(5/6)^4 approx 0.5177, (1) which is slightly higher than the probability of at least ...