449 research outputs found
A notion of minor-based matroid connectivity
For a matroid , a matroid is -connected if every two elements of
are in an -minor together. Thus a matroid is connected if and only if it
is -connected. This paper proves that is the only connected
matroid such that if is -connected with , then or is -connected for all elements . Moreover, we
show that and are the only connected matroids
such that, whenever a matroid has an -minor using and an -minor
using , it also has an -minor using . Finally, we show
that is -connected if and only if every clonal
class of is trivial.Comment: 13 page
On perturbations of highly connected dyadic matroids
Geelen, Gerards, and Whittle [3] announced the following result: let be a prime power, and let be a proper minor-closed class of
-representable matroids, which does not contain
for sufficiently high . There exist integers
such that every vertically -connected matroid in is a
rank- perturbation of a frame matroid or the dual of a frame matroid
over . 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.Comment: Version 3 has a new title and a few other minor corrections; 38
pages, including a 6-page Jupyter notebook that contains SageMath code and
that is also available in the ancillary file
On the existence of asymptotically good linear codes in minor-closed classes
Let be a sequence of codes such that each
is a linear -code over some fixed finite field
, where is the length of the codewords, is the
dimension, and is the minimum distance. We say that is
asymptotically good if, for some and for all , , , and . Sequences of
asymptotically good codes exist. We prove that if is a class of
GF-linear codes (where is prime and ), closed under
puncturing and shortening, and if contains an asymptotically good
sequence, then must contain all GF-linear codes. Our proof
relies on a powerful new result from matroid structure theory
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices
We prove that every infinite sequence of skew-symmetric or symmetric matrices
M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such
that M_i is isomorphic to a principal submatrix of the Schur complement of a
nonsingular principal submatrix in M_j, if those matrices have bounded
rank-width. This generalizes three theorems on well-quasi-ordering of graphs or
matroids admitting good tree-like decompositions; (1) Robertson and Seymour's
theorem for graphs of bounded tree-width, (2) Geelen, Gerards, and Whittle's
theorem for matroids representable over a fixed finite field having bounded
branch-width, and (3) Oum's theorem for graphs of bounded rank-width with
respect to pivot-minors.Comment: 43 page
An obstacle to a decomposition theorem for near-regular matroids
Seymour's Decomposition Theorem for regular matroids states that any matroid
representable over both GF(2) and GF(3) can be obtained from matroids that are
graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped
that similar characterizations hold for other classes of matroids, notably for
the class of near-regular matroids. Suppose that all near-regular matroids can
be obtained from matroids that belong to a few basic classes through k-sums.
Also suppose that these basic classes are such that, whenever a class contains
all graphic matroids, it does not contain all cographic matroids. We show that
in that case 3-sums will not suffice.Comment: 11 pages, 1 figur
Tensor structure from scalar Feynman matroids
We show how to interpret the scalar Feynman integrals which appear when
reducing tensor integrals as scalar Feynman integrals coming from certain nice
matroids.Comment: 12 pages, corrections suggested by referee
- …