当前位置: X-MOL 学术Combinatorica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Diophantine Ramsey Theorem Tomasz Schoen
Combinatorica ( IF 1.0 ) Pub Date : 2020-11-26 , DOI: 10.1007/s00493-020-4482-5
Tomasz Schoen

Let p ∈ ℤ [x] be any polynomial with p(0) =0, k ∈ ℕ and let c1, …, cs ∈ ℤ, sk(k + 1), be non-zero integers such that \(\sum {{c_i} = 0} \). We show that for a wide class of coefficients c1, …, cs in every finite coloring ℕ = A1∪ ⃯ ∪ Ar there is a monochromatic solution to the equation \({c_1}x_1^k + \cdots + {c_s}x_s^k = {\rm{p}}\left(y \right).\).



中文翻译:

Diophantine Ramsey定理Tomasz Schoen

令p∈ℤ[ X ]是任何多项式其中p(0)= 0,ķ ∈ℕ和让ç 1,...,c ^小号∈ℤ,小号ķķ + 1),是非零的整数,使得\ (\ sum {{c_i} = 0} \)。我们表明,对于宽类系数Ç 1,...,c ^ š在每个有限着色ℕ=1 ∪⃯∪- [R有一个单色溶液等式\({C_1} X_1 ^ K + \ cdots + { c_s} x_s ^ k = {\ rm {p}} \ left(y \ right)。\)

更新日期:2020-11-27
down
wechat
bug