Geelen, Gerards, and Whittle [3] announced the following result: let q = p k be a prime power, and let M be a proper minor-closed class of GF(q)-representable matroids, which does not contain PG(r − 1, p) for sufficiently high r. There exist integers k, t such that every vertically k-connected matroid in M is a rank-(≤ t) perturbation of a frame matroid or the dual of a frame matroid over GF(q). They further announced a characterization of the perturbations through the introduction of subfield templates and frame templates.We show a family of dyadic matroids that form a counterexample to this result. We offer several weaker conjectures to replace the ones in [3], discuss consequences for some published papers, and discuss the impact of these new conjectures on the structure of frame templates. 1 arXiv:1712.07702v3 [math.CO]In this paper we present a counterexample to this conjecture. In particular, we build a family of dyadic matroids that are vertically kconnected for any desired k, and not a bounded-rank perturbation of either a represented frame matroid or the dual of a represented frame matroid. The construction starts with a cyclically k-connected graph G, modifies it at a number of vertices that grows with |V (G)|, and dualizes the resulting matroid. We detail the construction, and prove its key properties, in Section 3.Vertical connectivity and cographic matroids are not very compatible notions. Because of this, our examples, which are very sparse, arise only in situations where one might expect the second outcome of the conjecture to hold. For this reason, the forthcoming proof of the Matroid Structure Theorem itself is not jeopardized, and versions of Conjecture 1.2 can be recovered. In Section 4, we provide several such conjectures. Included in Section 4 is Section 4.3, where we discuss consequences for [10] and [15]. In Section 5, we discuss consequences for the notion of frame templates, introduced in [3] to describe the perturbations in more detail. PreliminariesUnexplained notation and terminology will generally follow Oxley [16]. One exception is that we denote the vector matroid of a matrix A by M (A), rather than M [A]. The following characterization of the dyadic matroids was shown by Whittle in [23].Theorem 2.1. A matroid is dyadic if and only if it is representable over both GF(3) and GF(5).We will need some definitions and results related to bounded-rank perturbations of represented matroids. The next three definitions are from [3].Definition 2.2. Let M 1 and M 2 be F-represented matroids on a common ground set. Then M 2 is a rank-(≤ t) perturbation of M 1 if there exist matrices A 1 and P such that M (A 1 ) = M 1 , the rank of P is at most t, and M (A 1 + P ) = M 2 . Definition 2.3. Let M 1 and M 2 be F-represented matroids on ground set E. If there is some F-represented matroid M on ground set E ∪ {e} such that M 1 = M \e and M 2 = M/e, then M 1 is an elementary lift of M 2 , and M 2 is an elementary projection of M 1 . Note that an elementary lift of a represented matroid M (A) can be ob...
The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we consider in each class only the highly connected matroids of sufficient size.
DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.