The number of zero sums modulo m in a sequence of length n

DOI10.1112/S0025579300007257zbMath0804.11019MaRDI QIDQ4304922

Mark Kisin

Publication date: 22 January 1995

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

Erdős-Ginzburg-Ziv theoremnumber of subsequences

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (9)

Representing Sequence Subsums as Sumsets of Near Equal Sized Sets ⋮ Serre's modularity conjecture: the level one case ⋮ Zero-sum problems in finite Abelian groups: a survey ⋮ Zero-sum problems -- a survey ⋮ Unnamed Item ⋮ On the number of fully weighted zero-sum subsequences ⋮ On the number of subsequences with given sum of sequences over finite abelian \(p\)-groups ⋮ Iterated sumsets and setpartitions ⋮ On the number of subsequences with given sum

Cites Work

• On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
• On the Addition of Residue Classes

This page was built for publication: The number of zero sums modulo m in a sequence of length n