对角线Rado数研究:对于$x+y+c=z$和$x+y+k=z$
Off-diagonal Rado numbers for $x+y+c=z$ and $x+y+k=z$
AI总结:
本文研究了非齐次线性方程组$x+y+c=z$和$x+y+k=z$(其中$c≤k)的离散和连续对角线Rado数,确定了精确的两色离散和连续对角线Rado数R₂(c,k)。
摘要:
Ramsey型问题对于线性方程的研究起源于Schur定理,后来由Richard Rado系统化。在非对角线设置中,固定一对不同的线性方程(E₁,E₂),寻找最小整数N,使得{1,2,…,N}的红蓝着色必然产生红色E₁解或蓝色E₂解。此阈值整数称为系统(E₁,E₂)的非对角线Rado数。本文研究了非齐次线性方程组x+y+c=z和x+y+k=z(其中c≤k)的离散和连续非对角线Rado数,确定了与该方程组相关的精确两色离散和连续非对角线Rado数R₂(c,k)。
英文摘要:
The study of Ramsey-type problems for linear equations originated with Schur's theorem and was later placed in a systematic framework by Richard Rado. In the off-diagonal setting, one fixes a pair of linear equations $(\mathcal{E}_1, \mathcal{E}_2)$ and seeks the least integer $N$ such that every red--blue coloring of $\{1,2,\dots,N\}$ contains either a red solution to $\mathcal{E}_1$ or a blue solution to $\mathcal{E}_2$. This threshold integer is referred to as the off-diagonal Rado number of the system $(\mathcal{E}_1, \mathcal{E}_2)$. In this work, we study the discrete and continuous two-color off-diagonal Rado numbers for the nonhomogeneous linear equations $x+y+c=z$ and $x+y+k=z$, where $c\leq k$. In the discrete setting, $c$ and $k$ are nonnegative integers, whereas in the continuous setting, they are nonnegative real numbers. We determine the exact discrete and continuous two-color off-diagonal Rado numbers for this pair of shifted Schur equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。