The correlation constant of a field
Combinatorics
2018-04-10 v1
Abstract
We study the correlation of edges, vectors or elements to be in a randomly chosen spanning tree or a basis, respectively. Here we follow the guideline of Huh and Wang and introduce as a measure an invariant that is called the correlation constant of a graph, vector configuration, matroid or field. It follows from one of their results that these correlation constants are numbers between and . Here, we show that the correlation constant of every field is at least . In our proof we explicitly construct vector configurations and matroids with positively correlated elements.
Keywords
Cite
@article{arxiv.1804.03071,
title = {The correlation constant of a field},
author = {Benjamin Schröter},
journal= {arXiv preprint arXiv:1804.03071},
year = {2018}
}
Comments
8 pages