On two conjectures for generalized off-diagonal Schur numbers
arXiv:2604.11030
Abstract
For an integer , let denote the linear equation where all variables are positive integers. For integers and , the generalized Schur number is the least positive integer such that every -coloring of , for some , a solution to with all variables monochromatic in color . In 2015, Ahmed and Schaal proposed a conjecture: for and . In this paper, we confirm this conjecture. At the same paper, they also conjecture that for . Motivated by the second conjecture, we give a recursive lower bound of and upper bounds for and for all sufficiently large .
13 pages