Search Results for ""

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

If a cyclic quadrilateral ABCD is inscribed in a circle c_1 of a coaxal system such that one pair AC of connectors touches another circle c_2 of the system at P, then each ...

Pong Hau K'i is an ancient Chinese tic-tac-toe-like game involving two players with two differently colored stones (say, red and blue). The players move their respective ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

Two triangles are said to be poristic triangles if they share the same incircle and circumcircle. More specifically, in the plane of a reference triangle, a triangle is said ...

Let A be a C^*-algebra. An element a in A is called positive if a=a* and sp(a) subset= R^+, or equivalently if there exists an element b in A such that a=bb^*. For example, ...

The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be positive lightlike if it has zero (Lorentzian) norm and if its first ...