227 research outputs found
The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics
AbstractLet q be a power of a prime and let s be zero or a prime not dividing q. Then the number of points in a combinatorial geometry (or simple matroid) of rank n which is representable over GF(q) and a field of characteristic s is at most (qν − qν−1)(2n+1)−n, where ν = 2q−1 − 1
Growth rate functions of dense classes of representable matroids
AbstractFor each proper minor-closed subclass M of the GF(q2)-representable matroids containing all GF(q)-representable matroids, we give, for all large r, a tight upper bound on the number of points in a rank-r matroid in M, and give a rank-r matroid in M for which equality holds. As a consequence, we give a tight upper bound on the number of points in a GF(q2)-representable, rank-r matroid of large rank with no PG(k,q2)-minor
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field P and B a matrix
representable over a sub-partial field P' of P. We say that B confines M to P'
if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled
P'-matrix. We show that, under some conditions on the partial fields, on M, and
on B, verifying whether B confines M to P' amounts to a finite check. A
corollary of this result is Whittle's Stabilizer Theorem.
A combination of the Confinement Theorem and the Lift Theorem from
arXiv:0804.3263 leads to a short proof of Whittle's characterization of the
matroids representable over GF(3) and other fields.
We also use a combination of the Confinement Theorem and the Lift Theorem to
prove a characterization, in terms of representability over partial fields, of
the 3-connected matroids that have k inequivalent representations over GF(5),
for k = 1, ..., 6.
Additionally we give, for a fixed matroid M, an algebraic construction of a
partial field P_M and a representation A over P_M such that every
representation of M over a partial field P is equal to f(A) for some
homomorphism f:P_M->P. Using the Confinement Theorem we prove an algebraic
analog of the theory of free expansions by Geelen et al.Comment: 45 page
On inequivalent representations of matroids over finite fields
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
The Contributions of Dominic Welsh to Matroid Theory
Dominic Welsh began writing papers in matroid theory nearly forty years ago. Since then, he has made numerous important contributions to the subject. This chapter reviews Dominic Welsh\u27s work in and influence on the development of matroid theory
A matroid analogue of a theorem of Brooks for graphs
Brooks proved that the chromatic number of a loopless connected graph G is at most the maximum degree of G unless G is an odd cycle or a clique. This note proves an analogue of this theorem for GF(p)-representable matroids when p is prime, thereby verifying a natural generalization of a conjecture of Peter Nelson
Extending a matroid by a cocircuit
AbstractOur main result describes how to extend a matroid so that its ground set is a modular hyperplane of the larger matroid. This result yields a new way to view Dowling lattices and new results about line-closed geometries. We complement these topics by showing that line-closure gives simple geometric proofs of the (mostly known) basic results about Dowling lattices. We pursue the topic of line-closure further by showing how to construct some line-closed geometries that are not supersolvable
- …