On the sequential and random selection of subspaces over a finite field

DOI10.1016/0097-3165(77)90069-3MaRDI QIDQ1236529zbMATH OpenOpenAlexFDO

Authors Eugenio Calabi, Herbert S. Wilf

Publication date 1977

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(77)90069-3

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Statistical block designs (62K10) Sequential statistical design (62L05) Vector spaces, linear dependence, rank, lineability (15A03)

Cited in

(9)

• Fair and distributed peer-to-peer allocation of a common, refillable resource
• The Subgroup Algorithm for Generating Uniform Random Variables
• Upper and lower estimates for the number of some k-dimensional subspaces of a given weight over a finite field
• Combinatorial identities by way of Wilf's multigraph model
• The nearest neighbor random walk on subspaces of a vector space and rate of convergence
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Some applications of algorithms for constructing subspaces over a finite field
• Bijective methods in the theory of finite vector spaces
• Application of a fast simulation method to the estimation of the number of some \(k\)-dimensional subspaces over a finite space

This page was built for publication: On the sequential and random selection of subspaces over a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1236529)