On determination of Zero-sum $\ell$-generalized Schur Numbers for some linear equations
Bidisha Roy, Subha Sarkar

TL;DR
This paper determines specific zero-sum Schur numbers for certain linear equations and provides bounds for others, advancing understanding of zero-sum problems in combinatorics.
Contribution
It completely determines several key zero-sum Schur numbers related to linear equations and establishes upper bounds for additional cases.
Findings
Exact values for $S_{z,2}^{(k,1)}(k;r;0)$ and other constants
Upper bounds for $S_{z,2}^{(2,1)}(k;2;0)$ and $S_{z,2}^{(1,1)}(k;2;v)$
Advances in zero-sum Schur number theory for linear equations
Abstract
Let , and be positive integers such that and let be any integer. For any integer and , we let be the linear homogeneous equation defined by . We denote the number , which is defined to be the least positive integer such that for any -coloring , there exists a solution to the equation that satisfies the -zero-sum condition, namely, . In this article, we completely determine the constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Topics in Algebra · Advanced Combinatorial Mathematics
