Zero-sum generalized Schur numbers

From MaRDI portal



Abstract: Let r and k be positive integers with rmidk. Denote by Smathrmmathfrakz(k;r) the minimum integer n such that every coloring chi:[1,n]ightarrow0,1,dots,r−1 admits a solution to sumi=1k−1xi=xk with sumi=1kchi(xi)equiv0,(mathrmmod,r). We give some formulas and lower bounds for various instances.












This page was built for publication: Zero-sum generalized Schur numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232593)