Javascript must be enabled to continue!
K-Regular Matroids
View through CrossRef
<p>The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF(2) is the class of near-regular matroids. Let k be a non-negative integer. This thesis considers the class of k-regular matroids, a generalization of the last two classes. Indeed, the classes of regular and near-regular matroids coincide with the classes of 0-regular and 1-regular matroids, respectively. This thesis extends many results for regular and near-regular matroids. In particular, for all k, the class of k-regular matroids is precisely the class of matroids representable over a particular partial field. Every 3-connected member of the classes of either regular or near-regular matroids has a unique representability property. This thesis extends this property to the 3-connected members of the class of k-regular matroids for all k. A matroid is [omega] -regular if it is k-regular for some k. It is shown that, for all k [greater than or equal to] 0, every 3-connected k-regular matroid is uniquely representable over the partial field canonically associated with the class of [omega] -regular matroids. To prove this result, the excluded-minor characterization of the class of k-regular matroids within the class of [omega] -regular matroids is first proved. It turns out that, for all k, there are a finite number of [omega] -regular excluded minors for the class of k-regular matroids. The proofs of the last two results on k-regular matroids are closely related. The result referred to next is quite different in this regard. The thesis determines, for all r and all k, the maximum number of points that a simple rank-r k-regular matroid can have and identifies all such matroids having this number. This last result generalizes the corresponding results for regular and near-regular matroids. Some of the main results for k-regular matroids are obtained via a matroid operation that is a generalization of the operation of [Delta] - Y exchange. This operation is called segment-cosegment exchange and, like the operation of [Delta] - Y exchange, has a dual operation. This thesis defines the generalized operation and its dual, and identifies many of their attractive properties. One property in particular, is that, for a partial field P, the set of excluded minors for representability over P is closed under the operations of segment-cosegment exchange and its dual. This result generalizes the corresponding result for [Delta] - Y and Y - [Delta] exchanges. Moreover, a consequence of it is that, for a prime power q, the number of excluded minors for GF(q)-representability is at least 2q-4.</p>
Title: K-Regular Matroids
Description:
<p>The class of matroids representable over all fields is the class of regular matroids.
The class of matroids representable over all fields except perhaps GF(2) is the class of near-regular matroids.
Let k be a non-negative integer.
This thesis considers the class of k-regular matroids, a generalization of the last two classes.
Indeed, the classes of regular and near-regular matroids coincide with the classes of 0-regular and 1-regular matroids, respectively.
This thesis extends many results for regular and near-regular matroids.
In particular, for all k, the class of k-regular matroids is precisely the class of matroids representable over a particular partial field.
Every 3-connected member of the classes of either regular or near-regular matroids has a unique representability property.
This thesis extends this property to the 3-connected members of the class of k-regular matroids for all k.
A matroid is [omega] -regular if it is k-regular for some k.
It is shown that, for all k [greater than or equal to] 0, every 3-connected k-regular matroid is uniquely representable over the partial field canonically associated with the class of [omega] -regular matroids.
To prove this result, the excluded-minor characterization of the class of k-regular matroids within the class of [omega] -regular matroids is first proved.
It turns out that, for all k, there are a finite number of [omega] -regular excluded minors for the class of k-regular matroids.
The proofs of the last two results on k-regular matroids are closely related.
The result referred to next is quite different in this regard.
The thesis determines, for all r and all k, the maximum number of points that a simple rank-r k-regular matroid can have and identifies all such matroids having this number.
This last result generalizes the corresponding results for regular and near-regular matroids.
Some of the main results for k-regular matroids are obtained via a matroid operation that is a generalization of the operation of [Delta] - Y exchange.
This operation is called segment-cosegment exchange and, like the operation of [Delta] - Y exchange, has a dual operation.
This thesis defines the generalized operation and its dual, and identifies many of their attractive properties.
One property in particular, is that, for a partial field P, the set of excluded minors for representability over P is closed under the operations of segment-cosegment exchange and its dual.
This result generalizes the corresponding result for [Delta] - Y and Y - [Delta] exchanges.
Moreover, a consequence of it is that, for a prime power q, the number of excluded minors for GF(q)-representability is at least 2q-4.
</p>.
Related Results
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
Chordality in Matroids: In Search of the Converse to Hliněný's Theorem
<p>Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chordal graphs of bounded treewidth. Hliněný [25] generalised Courcelle's T...
Non-representable hyperbolic matroids
Non-representable hyperbolic matroids
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of ...
Matroids, Cyclic Flats, and Polyhedra
Matroids, Cyclic Flats, and Polyhedra
<p>Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are able to be efficiently ...
On Density-Critical Matroids
On Density-Critical Matroids
For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper min...
Covering Cycle Matroid
Covering Cycle Matroid
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based o...
Fan-Extensions in Fragile Matroids
Fan-Extensions in Fragile Matroids
If $\mathcal{S}$ is a set of matroids, then the matroid $M$ is $\mathcal{S}$-fragile if, for every element $e\in E(M)$, either $M\backslash e$ or $M/e$ has no minor isomorphic to a...
[RETRACTED] Keanu Reeves CBD Gummies v1
[RETRACTED] Keanu Reeves CBD Gummies v1
[RETRACTED]Keanu Reeves CBD Gummies ==❱❱ Huge Discounts:[HURRY UP ] Absolute Keanu Reeves CBD Gummies (Available)Order Online Only!! ❰❰= https://www.facebook.com/Keanu-Reeves-CBD-G...
Pythagorean Fuzzy Matroids with Application
Pythagorean Fuzzy Matroids with Application
The Pythagorean fuzzy models deal with graphical and algebraic structures in case of vague information related to membership and non-membership grades. Here, we use Pythagorean fuz...

