Search Results for ""

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

A construction done using only a straightedge. The Poncelet-Steiner theorem proves that all constructions possible using a compass and straightedge are possible using a ...

Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...

Let H be a Hilbert space and (e_i)_(i in I) an orthonormal basis for H. The set of all products of two Hilbert-Schmidt operators is denoted N(H), and its elements are called ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

A truth table is a two-dimensional array with n+1 columns. The first n columns correspond to the possible values of n inputs, and the last column to the operation being ...

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A figure used in many Asian cultures to symbolize the unity of the two "opposite" female and male elements, the "yin" and "yang." The solid and hollow parts composing the ...

The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...

Define a valid "coloring" to occur when no two faces with a common edge share the same color. Given two colors, there is a single way to color an octahedron (Ball and Coxeter ...