Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 16 (1984), S. 107-121 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study a class of diagram geometries, achieve a characterization of extended dual affine planes, and embed extended dual affine planes in extended projective planes. The geometries studied are rank 3 diagram geometries such that the residue of a point is a dual net, and the residue of a plane is linear; the dual of such a geometry has partitions on lines and planes which are reminiscent of parallelism of lines and planes of an affine 3-space. Examples of these geometries (some in dual form) include extended dual affine planes, Laguerre planes, 3-nets, and orthogonal arrays of strength 3. Theorem: Any such finite geometry satisfying Buekenhout's intersection property, and such that any two points are coplanar, is an extended dual affine plane (and has order 2, 4, or 10). Theorem: This geometry may be embedded in an extended projective plane of the same order.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 16 (1984), S. 149-156 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A special Laguerre plane is a nondegenerate transversal 3-design such that the residue of each point is a dual affine plane. A special Laguerre plane is equivalent to an optimal code with three information digits and maximal length. An extended dual affine plane is an incidence structure (whose objects will be called points and blocks) such that the residue of each point is a dual affine plane, and each pair of points is in at least one block. Finite extended dual affine planes exist only of order 2, 4, and (dubiously) 10. We show that any finite incidence structure having the residue of each point a dual affine plane either is a transversal 3-design or has a block through each pair of points. Hence theorem: If a finite nondegenerate connected incidence structure θ has the residue of each point a dual affine plane, then θ is either an extended dual affine plane or a special Laguerre plane.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Geometriae dedicata 5 (1976), S. 361-376 
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Archiv der Mathematik 33 (1979), S. 383-391 
    ISSN: 1420-8938
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 21 (1992), S. 303-312 
    ISSN: 1573-7640
    Keywords: Parallel algorithm ; dominance ; compaction ; constraint graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A parallel algorithm to generate the dominance graph on a collection of nonoverlapping iso-oriented rectangles is presented. This graph arises from the constraint graph commonly used in compaction algorithms for VLSI circuits. The dominance graph expresses the notion of “aboveness” on a collection of nonoverlapping rectangles: it is the directed graph which contains an edge from a rectangleb to rectanglec iffc is immediately aboveb. The algorithm is based on the divide and conquer paradigm; in the EREW PRAM model, it has time complexityO(log2 n), usingn/logn processors. Its processor-time product isO(nlogn), which is optimal.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...