A polynomial-time algorithm for finding zero-sums.

DOI10.1016/J.DISC.2008.06.018MaRDI QIDQ1043611zbMATH OpenOpenAlexFDO

Authors A. 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

polynomial-time algorithmszero-sum sequences[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ginzburg-Ziv+theorem&go=Go Erd��s-Ginzburg-Ziv theorem]finite Abelian groups

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2098030
• The polynomial method in the study of zero-sum theorems
• Algebraic complexity of computing polynomial zeros
• An algorithm for locating all zeros of a real polynomial
• An algorithm for a result on minimal polynomials
• scientific article; zbMATH DE number 94971
• scientific article; zbMATH DE number 3980478
• A divide and conquer method for polynomial zeros
• On the Complexity of Polynomial Zeros
• A composite polynomial zerofinding matrix algorithm

Cites work

• scientific article; zbMATH DE number 3683884 (Why is no real title available?)
• scientific article; zbMATH DE number 524118 (Why is no real title available?)
• scientific article; zbMATH DE number 3102822 (Why is no real title available?)
• A Combinatorial Problem on Abelian Groups
• A combinatorial problem on finite abelian groups
• 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 three zero‐sum Ramsey‐type problems
• On weighted sums in abelian groups
• On zero-trees
• Reconstructing permutation matrices from diagonal sums
• Remarks on a zero-sum theorem
• Zero-sum problems -- a survey

Cited in

(1)

• On zero-sum subsequences of restricted size

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043611)