Kahn conjectured in 1988 that, for each prime power q, there is an integer n(q) such that no 3-connected GF(q)-representable matroid has more than n(q) inequivalent GF(q)-representations. At the time, this conjecture was known to be true for q=2 and q=3, and Kahn had just proved it for q=4. In this
Inequivalent representations of ternary matroids
โ Scribed by Geoff Whittle
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 327 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper considers representations of ternary matroids over fields other than GF(3). It is shown that a 3-connected ternary matroid representable over a finite field F has at most IFI -2 inequivalent representations over F. This resolves a special case of a conjecture of Kahn in the affirmative.
๐ SIMILAR VOLUMES
The asymptotic value as nPR of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids.
Let M be a class of matroids representable over a field F. A matroid N # M stabilizes M if, for any 3-connected matroid M # M, an F-representation of M is uniquely determined by a representation of any one of its N-minors. One of the main theorems of this paper proves that if M is minor-closed and c
Let M and N be ternary matroids having the same rank and the same ground set, and assume that every independent set in N is also independent in M. The main result of this paper proves that if M is 3-connected and N is connected and non-binary, then M = N . A related result characterizes precisely wh