Abstract
In [9, p. 469], Oxley made the following conjecture, which is a geometric analogue of a
conjecture of Lovász (see [1, p. 290]) about complete graphs.Conjecture 1.1.Let G be a rank-n GF(q)-representable simple matroid with critical
exponent n − γ. If, for every coline X in G,
c(G/X; q) = c(G; q) − 2 = n − γ − 2,
then G is the projective geometry PG(n − 1, q).We shall call the rank n, the critical ‘co-exponent’ γ, and the order q of the field the
parameters of Oxley's conjecture. We exhibit several counterexamples to this conjecture.
These examples show that, for a given prime power q and a given positive integer γ,
Oxley's conjecture holds for only finitely many ranks n. We shall assume familiarity with
matroid theory and, in particular, the theory of critical problems. See [6] and [9].A subset C of points of PG(n − 1, q) is a (γ, k)-cordon if,
for every k-codimensional subspace X in PG(n − 1, q), the intersection
C ∩ X contains a γ-dimensional subspace of PG(n − 1, q). In this
paper, our primary interest will be in constructing (γ, 2)-cordons.
With straightforward modifications, our methods will also yield (γ, k)-cordons.Complements of counterexamples to Oxley's conjecture are (γ, 2)-cordons.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Critical Problem for codes over finite chain rings;Finite Fields and Their Applications;2021-12
2. On critical exponents of Dowling matroids;Designs, Codes and Cryptography;2017-10-23
3. On the Covering Dimension of a Linear Code;IEEE Transactions on Information Theory;2016-05
4. Minimal blocks of binary even-weight vectors;Linear Algebra and its Applications;2006-07