On the construction of a family of transversal subspaces over finite fields

DOI10.1016/j.laa.2008.03.014zbMath1143.15002OpenAlexW2074569912MaRDI QIDQ929484

Hervé Fournier, Sylvain Perifel, Pascal Koiran, Alexander L. Chistov

Publication date: 17 June 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://hal-ens-lyon.archives-ouvertes.fr/ensl-00175872/file/sev.pdf

zbMATH Keywords

finite fieldspolynomial time algorithmlinear subspacestransversality property

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

Higgledy-piggledy subspaces and uniform subspace designs ⋮ A polynomial bound on the number of comaximal localizations needed in order to make free a projective module

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vandermonde matrices, NP-completeness and transversal subspaces
• On the number of zero-patterns of a sequence of polynomials
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On the existence of hard sparse sets under weak reductions
• The complexification and degree of a semi-algebraic set.

This page was built for publication: On the construction of a family of transversal subspaces over finite fields