Two well-defined classes of structured polynomial systems have been studied from this point of view—sparse systems, where the structure is encoded by the monomials in the polynomials fi—and geometric systems, where the structure comes from geometry. This second class consists of polynomial formulations of enumerative geometric problems, and in this case Question 1.1 is the motivating question o...

Codes in the Grassmannian space have found recently application in network coding. Representation of kdimensional subspaces of Fq has generally an essential role in solving coding problems in the Grassmannian, and in particular in encoding subspaces of the Grassmannian. Different representations of subspaces in the Grassmannian are presented. We use two of these representations for enumerative ...