English

Average plane-size in complex-representable matroids

Combinatorics 2024-03-05 v2

Abstract

Melchior's inequality implies that the average line-length in a simple, rank-33, real-representable matroid is less than 33. A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound of 44. We show that the average plane-size in a simple, rank-44, complex-representable matroid is bounded above by an absolute constant, unless the matroid is the direct-sum of two lines. We also prove that, for any integer kk, in complex-representable matroids with rank at least 2k12k-1, the average size of a rank-kk flat is bounded above by a constant depending only on kk. Finally, we prove that, for any integer r2r\ge 2, the average flat-size in rank-rr complex-representable matroids is bounded above by a constant depending only on rr. We obtain our results using a theorem, due to Ben Lund, that gives a good estimate on the number of rank-kk flats in a complex-representable matroid.

Keywords

Cite

@article{arxiv.2310.02826,
  title  = {Average plane-size in complex-representable matroids},
  author = {Rutger Campbell and Jim Geelen and Matthew E. Kroeker},
  journal= {arXiv preprint arXiv:2310.02826},
  year   = {2024}
}
R2 v1 2026-06-28T12:40:26.782Z