English

Adjoints of Matroids

Combinatorics 2023-04-18 v1

Abstract

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can be given by its opposite lattice, and proceed to present some alternative characterizations of modular matroids associated to adjoints and opposite lattices. The other purpose is to investigate the adjoint sequence ad0M,adM,ad2M,ad^0M,adM,ad^2M,\ldots of a connected matroid MM. We classify such adjoint sequences into three types: finite, cyclic and convergent. For the first two types, the adjoint sequences eventually stabilize at the finite projective geometries except for free matroids. For the last type, the infinite non-repeating adjoint sequences are convergent to the infinite projective geometries.

Keywords

Cite

@article{arxiv.2304.08000,
  title  = {Adjoints of Matroids},
  author = {Houshan Fu and Chunming Tang and Suijie Wang},
  journal= {arXiv preprint arXiv:2304.08000},
  year   = {2023}
}
R2 v1 2026-06-28T10:07:50.757Z