The minimum rank problem over finite fields

DOI10.13001/1081-3810.1402MaRDI QIDQ3075175zbMATH OpenOpenAlexFDO

Authors Jason Grout

Publication date 10 February 2011

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0801.2987, https://eudml.org/doc/233166, http://www.emis.de/journals/ELA/ela-articles/abstracts/abs_vol20_pp691-716.pdf, https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1981&context=etd

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

projective geometryfinite fieldsymmetric matrixminimum rankpolarity graphbilinear symmetric form

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of finite geometries (05B25) Structural characterization of families of graphs (05C75) Combinatorial structures in finite projective spaces (51E20) Vector spaces, linear dependence, rank, lineability (15A03)

Abstract: The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained. Using this connection, a few results in the minimum rank problem are derived by applying some known results from projective geometry.

Recommendations

• On minimal rank over finite fields
• On the minimum rank of a graph over finite fields
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• The minimum rank problem for circulants
• Minimum rank problems
• Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
• The minimum rank problem: A counterexample
• MaxMinMax problem and sparse equations over finite fields
• Lower bounds in minimum rank problems
• On the rank of certain finite fields

Cited in

(5)

• The minimum rank problem over the finite field of order 2: Minimum rank 3
• On minimal rank over finite fields
• Graphs whose minimal rank is two: The finite fields case
• On the minimum rank of a graph over finite fields
• Odd cycle zero forcing parameters and the minimum rank of graph blowups

Describes a project that uses

Uses Software

• SageMath
• nauty

This page was built for publication: The minimum rank problem over finite fields

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