A nearly finitary matroid that is not k-nearly finitary

DOI10.37236/10467MaRDI QIDQ6197804zbMATH OpenOpenAlexFDO

Authors Patrick Tam

Publication date 19 February 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/10467

zbMATH Keywords

\(k\)-nearly finitary matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Review text

Summary: The class of \(k\)-nearly finitary matroids for some natural number \(k\) is a subclass of the class of nearly finitary matroids. A natural question is whether this inclusion is proper. We answer this question affirmatively by constructing a nearly finitary matroid that is not \(k\)-nearly finitary for any \(k \in \mathbb{N}\).

Recommendations

• On two classes of nearly binary matroids
• On axiomatizability of the class of finitary matroids and decidability of their universal theory
• Fractal classes of matroids
• A new class of matroids
• On infinite antichains of matroids

Cites work

• Axioms for infinite matroids
• On the intersection of infinite matroids

This page was built for publication: A nearly finitary matroid that is not \(k\)-nearly finitary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197804)