Partial geometric lattices. I: Regularity conditions (Q1100207): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0378-3758(87)90099-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987292061 / rank
 
Normal rank

Revision as of 03:02, 20 March 2024

scientific article
Language Label Description Also known as
English
Partial geometric lattices. I: Regularity conditions
scientific article

    Statements

    Partial geometric lattices. I: Regularity conditions (English)
    0 references
    0 references
    0 references
    1987
    0 references
    This paper introduces partial geometric lattices, which generalize to arbitrary rank, partial geometries studied by Bose, which are partial geometries of rank 3, and the partial geometries of dimension 3 studied by Laskar and Dunbar, which are a subclass of the partial geometric lattices of rank 4. The main result is that the number of spaces of a given rank \(i+k\) which contain a given i-space and are contained in a given \((i+s)\)-space depends only on the ranks \(i,i+k\) and \(i+s\). This function is called \(\phi\) (i,s,k). It, along with related functions, is calculated for rank 3 and 4. These combinatorial structures should prove useful in the study of hierarchical experimental designs both factorial and non-factorial, and in coding theory and combinatorial information theory.
    0 references
    0 references
    0 references
    0 references
    0 references
    factorial designs
    0 references
    non-factorial designs
    0 references
    partial geometric lattices
    0 references
    partial geometries
    0 references
    hierarchical experimental designs
    0 references
    coding theory
    0 references
    combinatorial information theory
    0 references
    0 references