A polynomial-time algorithm for finding zero-sums.

DOI10.1016/j.disc.2008.06.018zbMath1180.20044OpenAlexW2063123247MaRDI QIDQ1043611

Alberto del Lungo, Claudio Marini, Elisa Mori

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.018

zbMATH Keywords

finite Abelian groupszero-sum sequencespolynomial-time algorithmsErdős-Ginzburg-Ziv theorem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Other combinatorial number theory (11B75) Finite abelian groups (20K01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler proof and a generalization of the zero-trees theorem
• On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
• On weighted sums in abelian groups
• Reconstructing permutation matrices from diagonal sums
• A combinatorial problem on finite abelian groups
• Zero-sum problems -- a survey
• Remarks on a zero-sum theorem
• On zero-trees
• On three zero‐sum Ramsey‐type problems
• A Combinatorial Problem on Abelian Groups

This page was built for publication: A polynomial-time algorithm for finding zero-sums.