Average plane-size in complex-representable matroids
Abstract
Melchior's inequality implies that the average line-length in a simple, rank-, real-representable matroid is less than . A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound of . We show that the average plane-size in a simple, rank-, 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 , in complex-representable matroids with rank at least , the average size of a rank- flat is bounded above by a constant depending only on . Finally, we prove that, for any integer , the average flat-size in rank- complex-representable matroids is bounded above by a constant depending only on . We obtain our results using a theorem, due to Ben Lund, that gives a good estimate on the number of rank- flats in a complex-representable matroid.
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}
}