Transfinite methods in geometry (Q1330770)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 617008
Language Label Description Also known as
default for all languages
No label defined
    English
    Transfinite methods in geometry
    scientific article; zbMATH DE number 617008

      Statements

      Transfinite methods in geometry (English)
      0 references
      0 references
      0 references
      10 August 1994
      0 references
      The authors show that many difficult questions in finite geometry can be easily resolved in infinite geometries, typically by using transfinite induction. For example a Steiner system \(S(t,k,v)\) consists of a \(v\)-set of points with a collection of \(k\)-subsets, called blocks, so that any \(t\) points lie in a unique block. Here it is assumed \(v\) is an infinite cardinal number, and \(k\) may be finite or infinite. An \(r\)-fold extension of an infinite projective plane is a Steiner system \(S(r + 2,v,v)\) having the property that no two blocks meet in exactly \(r\) points. It is shown here that any infinite projective plane has an \(r\)-fold extension in which any two blocks meet in \(r + 1\) points. As another example infinite analogues of ovoids are constructed. More precisely, let \(n\) and \(k\) be integers greater than or equal to 2, and let \(F\) be an infinite field. Then it is shown that there is a set \(S\) of points in \(PG(n,F)\) such that (a) \(| S\cap L|=0,1\) or \(k\) for any line \(L\), and (b) for any point \(p \in S\), the union of lines \(L\) satisfying \(S \cap L = \{p\}\) is a hyperplane \(H_ p\). The paper closes with a number of open problems.
      0 references
      transfinite induction
      0 references
      infinite geometries
      0 references
      Steiner system
      0 references
      blocks
      0 references
      ovoids
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references