Search Results for ""

A projection of the Veronese surface into three dimensions (which must contain singularities) is called a Steiner surface. A classification of Steiner surfaces allowing ...

A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The Steiner triangle DeltaS_AS_BS_C (a term coined here for the first time), is the Cevian triangle of the Steiner point S. It is the polar triangle of the Kiepert parabola. ...

Let X be a set of v>=3 elements together with a set B of 3-subset (triples) of X such that every 2-subset of X occurs in exactly one triple of B. Then B is called a Steiner ...

The locus of points whose first polars with regard to the curves of a linear net have a common point. It is also the locus of points of concurrence of line polars of points ...

If a Steiner chain is formed from one starting circle, then a Steiner chain is formed from any other starting circle. In other words, given two circles with one interior to ...

For what value of x is f(x)=x^(1/x) a maximum? The maximum occurs at x=e, where f^'(x)=x^(-2+1/x)(1-lnx)=0, (1) which is zero at x=e and gives a maximum of ...

Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...

The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...