Rigged Horse Numbers and their Modular Periodicity

Abstract

The Fubini numbers count the permutations of horse racing where ties are possible. The closely related r-horse numbers count the finishes of a horse race where some subset of r horses agree to finish the race in a specific relative strong ordering. We express the r-Fubini numbers as a sum of r index-shifted sequences of Fubini numbers weighted with the signed Stirling numbers of the first kind. We use a novel shift operator counting. Further, we demonstrate the eventual modular periodicity of r-Fubini numbers. Their maximum period is determined to be the Carmichael function of the modulus. The maximum period occurs in the case of an odd modulus for Fubini numbers.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…