Separating finite Laurent support by an integer weight

ID: separating-finite-laurent-support-by-an-integer-weight

Given a finite set of exponent vectors, there is for which the integers , , are pairwise distinct. For , take with larger than every first-coordinate difference in . In higher dimensions take with sufficiently large. This proves that a nonzero Laurent polynomial can be detected by a substitution without cancellation of its distinct terms.

New to topics? Read the docs here!