Search Results for ""

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...

In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

The metric tensor g on a smooth manifold M=(M,g) is said to be semi-Riemannian if the index of g is nonzero. In nearly all literature, the term semi-Riemannian is used ...

A separating family is a set of subsets in which each pair of adjacent elements are found separated, each in one of two disjoint subsets. The 26 letters of the alphabet can ...

Significance arithmetic is the arithmetic of approximate numerical quantities that not only keeps track of numerical results, but also uses error propagation to track their ...

Starting with a triangle, draw a circle touching two sides. Then draw a circle tangent to this circle and two other sides. Continue in the same direction. The result is a ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...

A stereohedron is a convex polyhedron that is isohedrally space-filling, meaning the symmetries of a tiling of copies of a stereohedron take any copy to any other copy. The ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...