Pairwise transitive 2-designs

We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs, intersecting block-pairs and non-intersecting block-pairs. These 2-designs fall into two classes: the symmetric ones and the quasisymmetric ones. The symmetric examples include the symmetric designs from projective geometry, the 11-point biplane, the Higman-Sims design, and designs of points and quadratic forms on symplectic spaces. The quasisymmetric examples arise from affine geometry and the point-line geometry of projective spaces, as well as several sporadic examples.Comment: 28 pages, updated after review proces

On Deletion in Delaunay Triangulation

This paper presents how the space of spheres and shelling may be used to delete a point from a $d$-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times. This algorithm may be viewed as a variation of Heller's algorithm, which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.Comment: 15 pages 5 figures. in Proc. 15th Annu. ACM Sympos. Comput. Geom., 181--188, 199

The problem of the turbo-compressor

In terminating the study of the adaptation of the engine to the airplane, we will examine the problem of the turbo-compressor,the first realization of which dates from the war; this will form an addition to the indications already given on supercharging at various altitudes. This subject is of great importance for the application of the turbo-compressor worked by the exhaust gases. As a matter of fact, a compressor increasing the pressure in the admission manifold may be controlled by the engine shaft by means of multiplication gear or by a turbine operated by the exhaust gas. Assuming that the increase of pressure in the admission manifold is the same in both cases, the pressure in the exhaust manifold would be greater in the case in which the compressor is worked by the exhaust gas and there would result a certain reduction of engine power which we must be able to calculate. On the other hand , if the compressor is controlled by the engine shaft, a certain fraction of the excess power supplied is utilized for the rotation of the compressor. In order to compare the two systems, it is there-fore necessary to determine the value of the reduction of power due to back pressure when the turbine is employed

Codistances of 3-spherical buildings

We show that a 3-spherical building in which each rank 2 residue is connected far away from a chamber, and each rank 3 residue is simply 2-connected far away from a chamber, admits a twinning (i.e., is one half of a twin building) as soon as it admits a codistance, i.e., a twinning with a single chamber.Comment: 35 pages; revised after a referee's comment

Finding an ordinary conic and an ordinary hyperplane

Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al. In this note we extend this result in two directions. We first show how to use this algorithm to compute an ordinary conic, that is, a conic passing through exactly five points, assuming that all the points do not lie on the same conic. Both our proofs of existence and the consequent algorithms are simpler than previous ones. We next show how to compute an ordinary hyperplane in three and higher dimensions.Comment: 7 pages, 2 figure