Effective versions of two theorems of Rado

2018/02/28 by Bell, Jason, Funk, Daryl, Kim, Byoung Du +1 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1802.10262

Abstract

Let M be a representable matroid on n elements. We give bounds, in terms of n, on the least positive characteristic and smallest field over which M is representable.

Cited by

• Information Inequalities for Five Random Variables

Related

• Certifying Non-representability of Matroids Over Prime Fields
• Representation of matroids
• On the complex-representable excluded minors for real-representability
• A Note on an Analytic Approach to the Problem of Matroid Representability, The Cardinality of Sets of k-Independent Vectors over Finite Fields and the Maximum Distance Separable Conjecture
• Yes, the "missing axiom" of matroid theory is lost forever