Title: On a class of combinatorial diophantine equations
Abstract: We give a combinatorial proof for a second order recurrence for the polynomials pn(x), where pn(k) counts the number of integer-coordinate lattice points x = (x1;::: ;xn) withkxk = P n=1 jxij k. This is the main step to get niteness results on the number of solutions of the diophantine equation pn(x) = pm(y) if n and m have dierent parity. The combinatorial approach also allows to extend the original diophantine result to more general combinatorial situations.
Publication Year: 2000
Publication Date: 2000-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot