Search Results for ""

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...

For a system of n first-order ordinary differential equations (or more generally, Pfaffian forms), the 2n-dimensional space consisting of the possible values of ...

If two algebraic plane curves with only ordinary singular points and cusps are related such that the coordinates of a point on either are rational functions of a ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Let F_0 and F_1 denote two directly similar figures in the plane, where P_1 in F_1 corresponds to P_0 in F_0 under the given similarity. Let r in (0,1), and define ...

Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...

For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...

The conjugate transpose of an m×n matrix A is the n×m matrix defined by A^(H)=A^_^(T), (1) where A^(T) denotes the transpose of the matrix A and A^_ denotes the conjugate ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...