Mon, June 8, 3pm EST (8pm BST, 7am Tue NZST)
Relinde Jurrius, Netherlands Defence Academy
q-Analogues in combinatorics
A q-analogue is, roughly speaking, what happens if we generalise from finite sets to finite dimensional vector spaces. The main focus of this talk will be, of course, the q-analogue of a matroid. Sometimes the change from sets to spaces goes very smoothly, but sometimes strange things (appear to) happen. This will be illustrated by discussing several cryptomorphic definitions of q-matroids. As an application of q-matroids, we link them to subspace designs, the q-analogue of combinatorial designs.