Kapranov rank vs. tropical rank
Abstract
We show that determining Kapranov rank of tropical matrices is not only NP-hard over any infinite field but also if solving Diophantine equations over the rational numbers is undecidable, then determining Kapranov rank over the rational numbers is undecidable. We prove that Kapranov rank of tropical matrices is not bounded in terms of tropical rank, answering a question of Develin, Santos, and Sturmfels.
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.