Free matroid

This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help by introducing citations to additional sources. Find sources:  –  ·  ·  · scholar · JSTOR (November 2020) Some of this article's listed sources may not be reliable. Please help this article by looking for better, more reliable sources. Unreliable citations may be challenged or deleted. (November 2020) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

In mathematics, the free matroid over a given ground-set E is the matroid in which the independent sets are all subsets of E.^[1] It is a special case of a uniform matroid. The unique basis of this matroid is the ground-set itself, E. Among matroids on E, the free matroid on E has the most independent sets, the highest rank, and the fewest circuits.

Free extension of a matroid[]

The free extension of a matroid ${\displaystyle M}$ by some element ${\displaystyle e\not \in M}$, denoted ${\displaystyle M+e}$, is a matroid whose elements are the elements of ${\displaystyle M}$ plus the new element ${\displaystyle e}$, and:

• Its circuits are the circuits of ${\displaystyle M}$ plus the sets ${\displaystyle B\cup \{e\}}$ for all bases ${\displaystyle B}$ of ${\displaystyle M}$.^[2]: 1
• Equivalently, its independent sets are the independent sets of ${\displaystyle M}$ plus the sets ${\displaystyle I\cup \{e\}}$ for all independent sets ${\displaystyle I}$ that are not bases.
• Equivalently, its bases are the bases of ${\displaystyle M}$ plus the sets ${\displaystyle I\cup \{e\}}$ for all independent sets of size ${\displaystyle {\text{rank}}(M)-1}$.

References[]

This mathematics-related article is a stub. You can help Wikipedia by .

• v
• t