Tournament score sequences, Erdos-Ginzburg-Ziv numbers, and the L\'evy-Khintchine method
Abstract
We give a short proof of a recent result of Claesson, Dukes, Frankl\'in and Stef\'ansson, connecting the number Sn of score sequences and the Erdos-Ginzburg-Ziv numbers Nn from additive number theory. Our proof utilizes the lattice path representation of score sequences by Erdos and Moser, and remarks by Kleitman added to an article of Moser regarding cyclic shifts of such paths. The connection between Sn and Nn is an instance of the L\'evy-Khintchine formula from probability theory. We highlight the utility of such formulas, by giving a short proof of Moser's conjecture that Sn C4n/n5/2, where C is described in terms of Nn.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.