On the uncommonness of minimal rank-2 systems of linear equations
Abstract
We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kamcev, Morrison and the second author. Moreover, we prove that any large system containing such a (2× k)-system as a minimal subsystem is uncommon.
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.