69 research outputs found

    Unlabeled equivalence for matroids representable over finite fields

    Full text link
    We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two r×nr\times n matrices AA and AA' representing the same matroid MM over a field FF are {\it geometrically equivalent representations} of MM if one can be obtained from the other by elementary row operations, column scaling, and column permutations. Using geometric equivalence, we give a method for exhaustively generating non-isomorphic matroids representable over a finite field GF(q)GF(q), where qq is a power of a prime

    On the unique representability of spikes over prime fields

    Get PDF
    For an integer n>2n>2, a rank-nn matroid is called an nn-spike if it consists of nn three-point lines through a common point such that, for all k{1,2,...,n1}k\in\{1, 2, ..., n - 1\}, the union of every set of kk of these lines has rank k+1k+1. Spikes are very special and important in matroid theory. In 2003 Wu found the exact numbers of nn-spikes over fields with 2, 3, 4, 5, 7 elements, and the asymptotic values for larger finite fields. In this paper, we prove that, for each prime number pp, a GF(pGF(p) representable nn-spike MM is only representable on fields with characteristic pp provided that n2p1n \ge 2p-1. Moreover, MM is uniquely representable over GF(p)GF(p).Comment: 8 page

    On inequivalent representations of matroids over non-prime fields

    Get PDF
    For each finite field FF of prime order there is a constant cc such that every 4-connected matroid has at most cc inequivalent representations over FF. We had hoped that this would extend to all finite fields, however, it was not to be. The (m,n)(m,n)-mace is the matroid obtained by adding a point freely to M(Km,n)M(K_{m,n}). For all n3n \geq 3, the (3,n)(3,n)-mace is 4-connected and has at least 2n2n representations over any field FF of non-prime order q9q \geq 9. More generally, for nmn \geq m, the (m,n)(m,n)-mace is vertically (m+1)(m+1)-connected and has at least 2n2n inequivalent representations over any finite field of non-prime order qmmq\geq m^m

    On inequivalent representations of matroids over finite fields

    Get PDF
    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 paper, we prove the conjecture for q = 5, showing that 6 is a sharp value for n(5). Moreover, we also show that the conjecture is false for all larger values of q. © 1996 Academic Press, Inc

    Inequivalent representations of ternary matroids

    Get PDF
    AbstractThis 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 ¦F¦ - 2 inequivalent representations over F. This resolves a special case of a conjecture of Kahn in the affirmative

    Totally free expansions of matroids

    Get PDF
    The aim of this paper is to give insight into the behaviour of inequivalent representations of 3-connected matroids. An element x of a matroid M is fixed if there is no extension M′ of M by an element x′ such that {x, x′} is independent and M′ is unaltered by swapping the labels on x and x′. When x is fixed, a representation of M.\x extends in at most one way to a representation of M. A 3-connected matroid N is totally free if neither N nor its dual has a fixed element whose deletion is a series extension of a 3-connected matroid. The significance of such matroids derives from the theorem, established here, that the number of inequivalent representations of a 3-connected matroid M over a finite field F is bounded above by the maximum, over all totally free minors N of M, of the number of inequivalent F-representations of N. It is proved that, within a class of matroids that is closed under minors and duality, the totally free matroids can be found by an inductive search. Such a search is employed to show that, for all r ≥ 4, there are unique and easily described rank-r quaternary and quinternary matroids, the first being the free spike. Finally, Seymour\u27s Splitter Theorem is extended by showing that the sequence of 3-connected matroids from a matroid M to a minor N, whose existence is guaranteed by the theorem, may be chosen so that all deletions and contractions of fixed and cofixed elements occur in the initial segment of the sequence. © 2001 Elsevier Science

    Fork-decompositions of matroids

    Get PDF
    For the abstract of this paper, please see the PDF file
    corecore