Evolution of random representable matroids: minors, circuits, connectivity and the critical number
Abstract
We study the evolution of random matroids represented by the sequence of random matrices over Fq where columns are added one after the other, and each column vector is a uniformly random vector in Fqn, independent of each other. We study the appearance of matroid minors, the appearance of circuits, the evolution of the connectivities and the critical number. We settle several open problems in the literature.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.