Search Results for ""

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

Extend the symmedians of a triangle DeltaA_1A_2A_3 to meet the circumcircle at P_1, P_2, P_3. Then the symmedian point K of DeltaA_1A_2A_3 is also the symmedian point of ...

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.

The slicing of a three-dimensional object by a plane (or more general slice).

The radial curve of the cycloid with parametric equations x = a(t-sint) (1) y = a(1-cost) (2) is the circle x_r = x_0+2asint (3) y_r = -2a+y_0+2acost. (4)

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

Given a square matrix M, the following are equivalent: 1. |M|!=0. 2. The columns of M are linearly independent. 3. The rows of M are linearly independent. 4. Range(M) = R^n. ...