Search Results for ""
1 - 10 of 97 for configurationsSearch Results
The word configuration is sometimes used to describe a finite collection of points p=(p_1,...,p_n), p_i in R^d, where R^d is a Euclidean space. The term "configuration" also ...
The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...
The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.
A 15_3 configuration of 15 lines and 15 points, with three lines through three points, three points on every line, and containing no triangles. It is illustrated above in two ...
It is possible to place 7 cigarettes in such a way that each touches every other if l/d>7sqrt(3)/2 (Gardner 1959, p. 115).
The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.
The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.
The desmic configuration is three-dimensional configuration of points consisting of three tetrads of points, each two of the tetrads of which are perspective from the four ...
A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...
Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...
...
View search results from all Wolfram sites (1444 matches)