Abstract
Algebraic matroids capture properties of the algebraic dependence among elements of extension fields. Almost entropic matroids have the rank functions arbitrarily well approximated by the entropies of subvectors of random vectors. The former class of matroids is included in the latter. A key argument in the proof is the Lang-Weil bound on the number of points in algebraic varieties.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
