An independent set axiomatization for symplectic matroids
Combinatorics
2007-05-23 v1
Abstract
One of the simplest axiomatizations of a matroid is in terms of independent sets. Curiously, no such independent set axiomatization is known for Gelfand and Serganova's WP-matroids (which are ``Coxeter group analogues'' of matroids). Here we state and prove such an axiomatization in the special case of symplectic matroids. No prior knowledge of WP-matroids is assumed; we believe the paper should be accessible and interesting to anyone with some interest in matroids.
Keywords
Cite
@article{arxiv.math/9804004,
title = {An independent set axiomatization for symplectic matroids},
author = {Timothy Y. Chow},
journal= {arXiv preprint arXiv:math/9804004},
year = {2007}
}
Comments
9 pages