pith. sign in

arxiv: 1808.03851 · v1 · pith:BNROGS3Jnew · submitted 2018-08-11 · 🧮 math.CO

Upper and Lower Bounds on Zero-Sum Generalized Schur Numbers

classification 🧮 math.CO
keywords mathfrakdotswhenboundscoloringequalequivfact
0
0 comments X
read the original abstract

Let $S_{\mathfrak{z}}(k,r)$ be the least positive integer such that for any $r$-coloring $\chi : \{1,2,\dots,S_{\mathfrak{z}}(k,r)\} \longrightarrow \{1, 2, \dots, r\}$, there is a sequence $x_1, x_2, \dots, x_k$ such that $\sum_{i=1}^{k-1} x_i = x_k$, and $\sum_{i=1}^{k} \chi(x_i) \equiv 0 \pmod{r}$. We show that when $k$ is greater than $r$, $kr - r - 1 \le S_{\mathfrak{z}}(k,r) \le kr - 1$, and when $r$ is an odd prime, $S_{\mathfrak{z}}(k,r)$ is in fact equal to $kr - r$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.