1 problem
Matching
Semilinear reducibility conjecture. For every , the graph is semilinearly reducible and, for every with no primes of bad reduction,
Semilinear reducibility conjecture. For every , the graph is semilinearly reducible and, for every with no primes of bad reduction,