Our paper titled List colouring of two matroids through reduction to partition matroids has been accepted for publication in SIAM Journal on Discrete Mathematics! The paper focuses on the question whether the list coloring number of the intersection of two matroids can be bounded by a constant times the coloring number. We consider matroid classes that appear naturally in combinatorial optimization problems, and show that if both matroids are from these classes, then the list coloring number is at most twice the coloring number.