Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Augspurger, C., Minter, M., Shoukry, K., Sissokho, P., Voss, K.: Avoiding zero-sum sequences of prescribed length over the integers. Integers 17, A18 (2017)
2. Berger, A.: An analogue of the Erdős–Ginzburg–Ziv theorem over $$\mathbb{Z} $$. Discrete Math. 342, 815–820 (2019). https://doi.org/10.1016/j.disc.2018.11.018
3. Berger, A., Wang, D.: Modified Erdős–Ginzburg–Ziv constants for $$\mathbb{Z} /n\mathbb{Z} $$ and $$(\mathbb{Z} /n\mathbb{Z} )^2$$. Discrete Math. 342, 1113–1116 (2019). https://doi.org/10.1016/j.disc.2018.12.024
4. Bitz, J., Griffith, C., He, X.: Exponential lower bounds on the generalized Erdős–Ginzburg–Ziv constant. Discrete Math. 343, 112083 (2020). https://doi.org/10.1016/j.disc.2020.112083
5. Gao, W.D.: On zero-sum subsequences of restricted size, II. Discrete Math. 271, 51–59 (2003). https://doi.org/10.1016/S0012-365X(03)00038-4