Bijective methods in the theory of finite vector spaces

DOI10.1016/0097-3165(84)90023-2zbMath0541.05003OpenAlexW1976600678WikidataQ114215157 ScholiaQ114215157MaRDI QIDQ794645

Herbert S. Wilf, Albert Nijenhuis, Anita E. Solow

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90023-2

zbMATH Keywords

Gaussian coefficientsechelon formPólya's theoremlattice walks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (13)

Invisible permutations and rook placements on a Ferrers board ⋮ Rook placements and cellular decomposition of partition varieties ⋮ Constacyclic codes over finite local Frobenius non-chain rings with nilpotency index 3 ⋮ Rook placements and generalized partition varieties ⋮ The Goldman-Rota identity and the Grassmann scheme ⋮ Unnamed Item ⋮ Unimodality of Gaussian coefficients: A constructive proof ⋮ Reduced matrices and q-log-concavity properties of q-Stirling numbers ⋮ A semi-recursion for the number of involutions in special orthogonal groups over finite fields ⋮ Characteristic subspaces and hyperinvariant frames ⋮ A statistic on involutions ⋮ Unnamed Item ⋮ Three problems in combinatorial asymptotics

Cites Work

• Unnamed Item
• Unnamed Item
• Mappings of subspaces into subsets
• On the sequential and random selection of subspaces over a finite field
• Subspaces, subsets, and partitions
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions

This page was built for publication: Bijective methods in the theory of finite vector spaces