Math 2.0

Concept

Base-orderable matroid

Summary

In mathematics, a base-orderable matroid is a matroid that has the following additional property, related to the bases of the matroid.

For any two bases AA and BB there exists a feasible exchange bijection, defined as a bijection ff from AA to BB, such that for every a∈A∖Ba\in A\setminus B, both (A∖{a})∪{f(a)}(A \setminus \{ a \}) \cup \{f(a)\} and (B∖{f(a)})∪{a}(B \setminus \{ f(a) \}) \cup \{a\} are bases.

The property was introduced by Brualdi and Scrimger. A strongly-base-orderable matroid has the following stronger property:

For any two bases AA and BB, there is a strong feasible exchange bijection, defined as a bijection ff from AA to BB, such that for every X⊆AX\subseteq A, both (A∖X)∪f(X)(A \setminus X) \cup f(X) and (B∖f(X))∪X(B \setminus f(X)) \cup X are bases.

Further reading

  1. Wikipedia, page 65674252, revision 1154271040, Base-orderable matroid. adopted
About this page
TagJ517QKT7CQ
URIm2://J517QKT7CQ
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.