Number of integers represented by families of binary forms III: fewnomials
Abstract
In a series of papers we investigated the following question: given a family of binary forms having nonzero discriminant and integer coefficients, for each d≥slant 3, we estimate the number of integers m with |m|≤slant N which are represented by an element in of degree ≥slant d. Under suitable assumptions, asymptotically as N∞, the main term in the estimate is given by the forms in having degree d (if any), while the forms of degree >d contribute only to the error term. The present text is devoted to fewnomials \[ a0Xkr+a1Xk(r-1)Yk+·s +ar-1XkYk(r-1)+arYkr \] with fixed r≥slant 1 and varying k,a0,a1,…,ar.
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.