Math 2.0

Areas Additive and combinatorial number theory Topic

Zero-sum problems

Summary

This topic is a part of additive and combinatorial number theory. It covers sequences in finite abelian groups that must contain a zero-sum subsequence of a given kind, and the invariants such as the Davenport constant that measure this.

About this page
Tag68A3DK7RF4
URIm2://68A3DK7RF4
Kindtopic
WritingW0 stub
MSC11B30, 11B75
Part ofAdditive and combinatorial number theory
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.