2000 character limit reached
Asymptotics for Pillai's problem with polynomials
Published 14 Dec 2021 in math.NT | (2112.07367v1)
Abstract: Let $ a_1(x)p_1(x)n + \cdots + a_k(x)p_k(x)n $ as well as $ b_1(x)q_1(x)m + \cdots + b_l(x) q_l(x)m $ be two polynomial power sums where the complex polynomials $ p_i(x) $ and $ q_j(x) $ are all non-constant. Then in the present paper we will give an asymptotic for the number of pairs $ (n,m) \in \mathbb{N}2 $ such that the degree of the sum of these two power sums is between $ 0 $ and $ d $ when $ d $ goes to infinity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.