Bijective methods in the theory of finite vector spaces (Q794645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5592270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspaces, subsets, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings of subspaces into subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential and random selection of subspaces over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675724 / rank
 
Normal rank

Latest revision as of 12:01, 14 June 2024

scientific article
Language Label Description Also known as
English
Bijective methods in the theory of finite vector spaces
scientific article

    Statements

    Bijective methods in the theory of finite vector spaces (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    The method, used to prove the following results is the observation that the canonical invariant of a vector subspace over a finite field is a matrix over the field, in reduced row echelon form (rref), whose rows span the subspace. To count subspaces is just count the matrices in rref. The results are: (a) a proof of a description, due to Pólya, of the coefficients of the Gaussian polynomials in terms of areas of certain lattice walks; (b) a proof of a three term recurrence relation satisfied by the ''Galois coefficients''; (c) an evaluation of the alternating sum of the Gaussian coefficients.
    0 references
    Pólya's theorem
    0 references
    echelon form
    0 references
    Gaussian coefficients
    0 references
    lattice walks
    0 references

    Identifiers