In their paper (1967, Math. Z. 99, 53 75) P. Dembowski and F. C. Piper gave a classification of quasiregular collineation groups of finite projective planes. In the case (d) or (g) in their list the corresponding group, say G, has a subset D satisfying that (V) there exist mutually disjoint subgroup
On disjoint sets of differences
✍ Scribed by P Erdös; Robert Freud
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 384 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let G s V, E be a t-partite graph with n vertices and m edges, where the Ž 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing Ž edges and, at the same time, the size of the largest set of
Consider the problem of recovering a set of real numbers X from the knowledge of its unlabeled set of differences xi --q > xi , xj E x, 1 <z.,j<N. (1) This problem comes up in different setups, among them in the so-called "phase problem in crystallography"; see [3] and the references given there.