Skip to content
DraconiticResearch
Search Sources API
197,357 studies31 sourcesUpdated 41 min ago
PreprintarXiv licencearXiv

Syzygy and Adjoint Matroids

Abstract

We give a matroid-theoretic analogue of Gaussian elimination and use it to construct, for every matroid M, the syzygy matroid Syz(M) on the collection of circuits of M. Dualizing the construction yields the combinatorial adjoint Adj(M) on the collection of maximal proper flats of M, and the two are related by Adj(M) \simeq Syz(M*). Neither construction depends on a realization. We determine Syz(M) when M is U_{k,k+3} or the Vamos matroid V_{8}. We also show that Adj(M) is an adjoint of M when M has rank 3. When M has rank 4 and V_{8} is a restriction of M, Adj(M) has rank 3 and is not an adjoint of M.

Related

  1. Auslander-type grade conditions and subcategories related to syzygy modules
    Yuya Otake
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Syzygy Transformations of Cluster Characters and Geometric Twists
    Jiarui Fei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Coherence and the Hilbert-syzygy identity for power series over valuation domains
    Mohamed Amine Aouichaoui, Adam Jones, Yiding Wang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. The residue field as an infinite syzygy
    Jian Liu, Justin Lyle
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Generalizing Green's Syzygy Theorems to Symmetric Products of Curves
    Wenbo Niu, Peter Yi Wei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{shin2026syzygy,
  title = {{Syzygy and Adjoint Matroids}},
  author = {Jaeho Shin},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30283},
  eprint = {2610.30283},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30283},
}
RIS
TY  - UNPB
TI  - Syzygy and Adjoint Matroids
AU  - Jaeho Shin
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30283
UR  - https://arxiv.org/abs/2610.30283
AB  - We give a matroid-theoretic analogue of Gaussian elimination and use it to construct, for every matroid M, the syzygy matroid Syz(M) on the collection of circuits of M. Dualizing the construction yields the combinatorial adjoint Adj(M) on the collection of maximal proper flats of M, and the two are related by Adj(M) \simeq Syz(M*). Neither construction depends on a realization. We determine Syz(M) when M is U_{k,k+3} or the Vamos matroid V_{8}. We also show that Adj(M) is an adjoint of M when M has rank 3. When M has rank 4 and V_{8} is a restriction of M, Adj(M) has rank 3 and is not an adjoint of M.
ER  -