Search Results for ""

Borsuk conjectured that it is possible to cut an n-dimensional shape of generalized diameter 1 into n+1 pieces each with diameter smaller than the original. It is true for ...

A bounded lattice is an algebraic structure L=(L, ^ , v ,0,1), such that (L, ^ , v ) is a lattice, and the constants 0,1 in L satisfy the following: 1. for all x in L, x ^ ...

The bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...

Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

Given a general quadrilateral with sides of lengths a, b, c, and d, the area is given by K = 1/4sqrt(4p^2q^2-(b^2+d^2-a^2-c^2)^2) (1) = (2) (Coolidge 1939; Ivanov 1960; Beyer ...

The dual of Pascal's theorem (Casey 1888, p. 146). It states that, given a hexagon circumscribed on a conic section, the lines joining opposite polygon vertices (polygon ...

The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...