Metraipolis › archive › dc_57337b2108da

Representability of Graphical Symplectic Matroids — arXiv:2611.01241

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01241
License (as archived)
CC0-1.0
Archived
2026-11-03T11:36:44.728Z
SHA-256 of the archived text
1988a255412fc225c68699da6ac2c44cabdb9bd668300a20f80a7813a3b9c169
Stable URL of this page
https://metraipolis.com/documento/dc_57337b2108da

How to cite

Representability of Graphical Symplectic Matroids — arXiv:2611.01241 — arXiv (en), https://arxiv.org/abs/2611.01241 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57337b2108da (Metraipolis archive dc_57337b2108da, sha256 1988a255412fc225c68699da6ac2c44cabdb9bd668300a20f80a7813a3b9c169)
BibTeX
@misc{dc57337b2108da,
  title = {Representability of Graphical Symplectic Matroids — arXiv:2611.01241},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01241},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57337b2108da; sha256 1988a255412fc225c68699da6ac2c44cabdb9bd668300a20f80a7813a3b9c169},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01241. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Chow associated with every finite multigraph $G$ a symplectic matroid $\GraphS{G}$ on the signed edge set $E\sqcup E^{*}$, whose restrictions to transversals are frame matroids of signed graphs, and Sarvepalli asked which of these matroids are representable. For a connected graph containing a cycle, we show that every isotropic representation of $S(G)$ admits an incidence-flow normal form. The remaining representation conditions are expressed through its admissible minors. Consequently, if $\GraphS{G}$ is $\F$-representable, then the bridgeless part of $G$ has a nowhere-zero $(\F,+)$-flow. In characteristic other than two, $\GraphS{G}$ is representable if and only if every non-loop edge on a cycle has a parallel mate. In characteristic two, we characterize the loopless graphs without two vertex-disjoint cycles by the existence of a nowhere-zero $(\F,+)$-flow, and we show that rigidly linked short cycles, and hence subdivisions of the prism, are obstructions. For $3$-connected simple graphs this gives a complete answer: $\GraphS{G}$ is $\F$-representable if and only if $\F$ has characteristic two, $G$ has no two vertex-disjoint cycles, and either $|\F|>2$ or $G\cong K_5$. In particular, the matroid of the Petersen graph is representable over no field. Finally, the admissible corank--nullity polynomial of an arbitrary symplectic matroid is intrinsic and satisfies a three-term contraction identity. For graphical symplectic matroids, this becomes a deletion-contraction recursion that closes up once marked vertices are allowed, and polynomials built from enveloping matroids agree with it exactly for sheltering envelopes.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01241 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.262Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).