LONGEST MINIMAL ZERO-SUM SEQUENCES OVER AN INTERVAL

Author

Nick Espe, Illinois State UniversityFollow
Jeremy Corry, Illinois State UniversityFollow
Damian DeDivitis, Illinois State UniversityFollow
Max Ward, Illinois State UniversityFollow

Publication Date

4-5-2019

Document Type

Poster

Degree Type

Undergraduate

Mentor

Papa Sissokho

Abstract

A zero-sum sequence is a collection of integers that sum to 0 (e.g., {5,-3,-2}). A zero sum sequence is minimal if it does not (properly) contain another zero sum sequence (e.g., {4,1,-2,-2,1} is not minimal). The main question question for this project is to determine longest minimal zero-sum sequence if all the numbers involved from the sequence are taken from the range [-t,k] for some positive integers t and k.

Recommended Citation

Espe, Nick; Corry, Jeremy; DeDivitis, Damian; and Ward, Max, "LONGEST MINIMAL ZERO-SUM SEQUENCES OVER AN INTERVAL" (2019). University Research Symposium. 263.
https://ir.library.illinoisstate.edu/rsp_urs/263