Academic literature on the topic 'Desargues configurations'

This paper solves an enumerative problem which arises naturally in the context of Pascal’s hexagram. We prove that a general Desargues configuration in the plane is associated to six conical sextuples via the theorems of Pascal and Kirkman. Moreover, the Galois group associated to this problem is isomorphic to the symmetric group on six letters.

We compute the fundamental group of various spaces of Desargues configurations in complex projective spaces: planar and non-planar configurations, with a fixed center and also with an arbitrary center.

The complete pole configuration of a planar n-link mechanism having one instantaneous degree of mobility, possesses (3n−4)/2 independent poles determining (n−2)2/2 remaining poles of the configuration. The dependency is demonstrated through Desargues’ Theorem and her generalizations. Simultaneously, pole configurations have been “elated” into three-dimensional point-lattices intersected by a plane. The insight obtained in these configurations allows the designer to find clues in building overconstrained linkage mechanisms meeting certain geometrical properties.

The article focuses on the optimization of the earlier discussed computer method of obtaining new forms of polyhedra based on projective geometry drawings (trace Dia- grams).While working on getting new multifaceted forms by projective geometry methods based on the well-known models of polyhedra on the first stage of the work it is required to calculate the parameters of projective geometry drawings, and then to build them. This is an often used apparatus of analytical geometry. According to it, at first the parameters of the polyhedron (core system of planes) are calculated, then we obtain the equation of the plane of the face of the polyhedron, and finally we obtain the equations of lines - the next plane faces on the selected curve plane. At each stage of application such a method requires the use of the algorithms of floating point arithmetic, on the one hand, leads to some loss of accuracy of the results and, on the other hand, the large amount of com- puter time to perform these operations in comparison with integer arithmetic operations.The proposed method is based on the laws existing between the lines that make up the drawing - the known configurations of projective geometry (complete quadrilaterals, configuration of Desargues, Pappus et al.).The authors discussed in detail the analysis procedure of projective geometry draw- ing and the presence of full quadrilaterals, Desargues and Pappus configurations in it.Since the composition of these configurations is invariant with respect to projec- tive change of the original nucleus, knowing them, you can avoid the calculations when solving the equations for finding direct projective geometry drawing analytically, getting them on the basis of belonging to a particular configuration. So you can get a definite advantage in accuracy of the results, and in the cost of computer time. Finding these basic configurations significantly enriches the set of methods and the use of projective geometry drawings.

A method of embedding nk configurations into projective space of k–1 dimensions is given. It breaks into the easy problem of finding a rooted spanning tree of the associated Levi graph. Also it is shown how to obtain a “complementary” “theorem” about projective space (over a field or skew-field F) from any nk theorem over F. Some elementary matroid theory is used, but with an explanation suitable for most people. Various examples are mentioned, including the planar configurations: Fano 73, Pappus 93, Desargues 103 (also in 3d-space), Möbius 84 (in 3d-space), and the resulting 74 in 3d-space, 96 in 5d-space, and 107 in 6d-space. (The Möbius configuration is self-complementary.) There are some nk configurations that are not embeddable in certain projective spaces, and these will be taken to similarly not embeddable configurations by complementation. Finally, there is a list of open questions.

AbstractWe discuss n4 configurations of n points and n planes in three-dimensional projective space. These have four points on each plane, and four planes through each point. When the last of the 4n incidences between points and planes happens as a consequence of the preceding 4n−1 the configuration is called a ‘theorem’. Using a graph-theoretic search algorithm we find that there are two 84 and one 94 ‘theorems’. One of these 84 ‘theorems’ was already found by Möbius in 1828, while the 94 ‘theorem’ is related to Desargues’ ten-point configuration. We prove these ‘theorems’ by various methods, and connect them with other questions, such as forbidden minors in graph theory, and sets of electrons that are energy minimal.

AbstractThe main goal of the paper is to establish a sufficient condition for a two-valenced association scheme to be schurian and separable. To this end, an analog of the Desargues theorem is introduced for a noncommutative geometry defined by the scheme in question. It turns out that if the geometry has enough many Desarguesian configurations, then under a technical condition, the scheme is schurian and separable. This result enables us to give short proofs for known statements on the schurity and separability of quasi-thin and pseudocyclic schemes. Moreover, by the same technique, we prove a new result: given a prime p, any $$\{1,p\}$$ { 1 , p } -scheme with thin residue isomorphic to an elementary abelian p-group of rank greater than two, is schurian and separable.