Abstract
Here we try to have a glimpse of the polynomial method used in the study of some zero-sum problems in additive combinatorics. While the first few sections of this paper are of an expository nature, in the last section we present some new results on bounds of some zero-sum constants obtained by generalizing a polynomial method. We also mention some open questions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
