Abstract
We produce new combinatorial methods for approaching the tropical maximal rank conjecture, including inductive procedures for deducing new cases of the conjecture on graphs of increasing genus from any given case. Using explicit calculations in a range of base cases, we prove this conjecture for the canonical divisor, and in a wide range of cases for m=3, extending previous results for m=2.
Original language | English |
---|---|
Pages (from-to) | 138-158 |
Number of pages | 21 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 152 |
DOIs | |
State | Published - Nov 2017 |
Bibliographical note
Publisher Copyright:© 2017 Elsevier Inc.
Keywords
- Maximal rank conjecture
- Tropical geometry
- Tropical independence
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics